<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Doxygen: surface/include/pcl/surface/3rdparty/poisson4/multi_grid_octree_data.hpp 源文件</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Doxygen
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- 制作者 Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'搜索','.html');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
  initMenu('',true,false,'search.php','搜索');
  $(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('multi__grid__octree__data_8hpp_source.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">multi_grid_octree_data.hpp</div>  </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment">Copyright (c) 2006, Michael Kazhdan and Matthew Bolitho</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment">All rights reserved.</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">Redistribution and use in source and binary forms, with or without modification,</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment">are permitted provided that the following conditions are met:</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment">Redistributions of source code must retain the above copyright notice, this list of</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment">conditions and the following disclaimer. Redistributions in binary form must reproduce</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment">the above copyright notice, this list of conditions and the following disclaimer</span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment">in the documentation and/or other materials provided with the distribution. </span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">Neither the name of the Johns Hopkins University nor the names of its contributors</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">may be used to endorse or promote products derived from this software without specific</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">prior written permission. </span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment">THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS &quot;AS IS&quot; AND ANY</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment">EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO THE IMPLIED WARRANTIES </span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment">OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT</span></div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="comment">SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,</span></div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="comment">INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="comment">TO, PROCUREMENT OF SUBSTITUTE  GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR</span></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="comment">BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN</span></div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="comment">CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN</span></div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="comment">ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH</span></div>
<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment">DAMAGE.</span></div>
<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="comment">*/</span></div>
<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160; </div>
<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="preprocessor">#include &quot;octree_poisson.h&quot;</span></div>
<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="preprocessor">#include &quot;mat.h&quot;</span></div>
<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160; </div>
<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="preprocessor">#if defined WIN32 || defined _WIN32</span></div>
<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="preprocessor">  #if !defined __MINGW32__</span></div>
<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="preprocessor">    #include &lt;intrin.h&gt;</span></div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="preprocessor">    #include &lt;hash_map&gt;</span></div>
<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="preprocessor">  #endif</span></div>
<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160; </div>
<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160; </div>
<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="preprocessor">#define ITERATION_POWER 1.0/3</span></div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="preprocessor">#define MEMORY_ALLOCATOR_BLOCK_SIZE 1&lt;&lt;12</span></div>
<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="preprocessor">#define SPLAT_ORDER 2</span></div>
<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160; </div>
<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;<span class="preprocessor">#ifndef _MSC_VER</span></div>
<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;<span class="keyword">namespace </span>std</div>
<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;{</div>
<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;  <span class="keyword">using namespace </span>__gnu_cxx;</div>
<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;}</div>
<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160; </div>
<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;<span class="keyword">namespace </span>pcl</div>
<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;{</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;  <span class="keyword">namespace </span>poisson</div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;  {</div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160; </div>
<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;    <span class="keyword">const</span> Real MATRIX_ENTRY_EPSILON = Real(0);</div>
<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;    <span class="keyword">const</span> Real EPSILON=Real(1e-6);</div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;    <span class="keyword">const</span> Real ROUND_EPS=Real(1e-5);</div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160; </div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;<span class="preprocessor">#if defined _WIN32 &amp;&amp; !defined __MINGW32__</span></div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;    <span class="keyword">using</span> stdext::hash_map;</div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;<span class="preprocessor">#else</span></div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;    <span class="keyword">using</span> std::hash_map;</div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160; </div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160; </div>
<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;    <span class="keywordtype">void</span> atomicOr(<span class="keyword">volatile</span> <span class="keywordtype">int</span>&amp; dest, <span class="keywordtype">int</span> value)</div>
<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;    {</div>
<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;<span class="preprocessor">#if defined _WIN32 &amp;&amp; !defined __MINGW32__</span></div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;<span class="preprocessor">    #if defined (_M_IX86)</span></div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;      _InterlockedOr( (<span class="keywordtype">long</span> <span class="keyword">volatile</span>*)&amp;dest, value );</div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;<span class="preprocessor">    #else</span></div>
<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;      InterlockedOr( (<span class="keywordtype">long</span> <span class="keyword">volatile</span>*)&amp;dest , value );</div>
<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;<span class="preprocessor">    #endif</span></div>
<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;<span class="preprocessor">#else </span><span class="comment">// !_WIN32 || __MINGW32__</span></div>
<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;<span class="preprocessor">    #pragma omp atomic</span></div>
<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;      dest |= value;</div>
<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// _WIN32 &amp;&amp; !__MINGW32__</span></div>
<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;    }</div>
<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160; </div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160; </div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;    <span class="comment">// SortedTreeNodes //</span></div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;<span class="comment"></span>    SortedTreeNodes::SortedTreeNodes(<span class="keywordtype">void</span>)</div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;    {</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;      nodeCount=NULL;</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;      treeNodes=NULL;</div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;      maxDepth=0;</div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;    }</div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;    SortedTreeNodes::~SortedTreeNodes(<span class="keywordtype">void</span>){</div>
<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;      <span class="keywordflow">if</span>( nodeCount ) <span class="keyword">delete</span>[] nodeCount;</div>
<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;      <span class="keywordflow">if</span>( treeNodes ) <span class="keyword">delete</span>[] treeNodes;</div>
<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;      nodeCount = NULL;</div>
<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;      treeNodes = NULL;</div>
<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;    }</div>
<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160; </div>
<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;    <span class="keywordtype">void</span> SortedTreeNodes::set( TreeOctNode&amp; root )</div>
<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;    {</div>
<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;      <span class="keywordflow">if</span>( nodeCount ) <span class="keyword">delete</span>[] nodeCount;</div>
<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;      <span class="keywordflow">if</span>( treeNodes ) <span class="keyword">delete</span>[] treeNodes;</div>
<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;      maxDepth = root.maxDepth()+1;</div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;      nodeCount = <span class="keyword">new</span> <span class="keywordtype">int</span>[ maxDepth+1 ];</div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;      treeNodes = <span class="keyword">new</span> TreeOctNode*[ root.nodes() ];</div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160; </div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;      nodeCount[0] = 0 , nodeCount[1] = 1;</div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;      treeNodes[0] = &amp;root;</div>
<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=1 ; d&lt;maxDepth ; d++ )</div>
<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;      {</div>
<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;        nodeCount[d+1] = nodeCount[d];</div>
<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=nodeCount[d-1] ; i&lt;nodeCount[d] ; i++ )</div>
<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        {</div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;          TreeOctNode* temp = treeNodes[i];</div>
<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;          <span class="keywordflow">if</span>( temp-&gt;children ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> c=0 ; c&lt;8 ; c++ ) treeNodes[ nodeCount[d+1]++ ] = temp-&gt;children + c;</div>
<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;        }</div>
<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;      }</div>
<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;nodeCount[maxDepth] ; i++ ) treeNodes[i]-&gt;nodeData.nodeIndex = i;</div>
<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;    }</div>
<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;    SortedTreeNodes::CornerIndices&amp; SortedTreeNodes::CornerTableData::operator[] ( <span class="keyword">const</span> TreeOctNode* node ) { <span class="keywordflow">return</span> cTable[ node-&gt;nodeData.nodeIndex + offsets[node-&gt;d] ]; }</div>
<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;    <span class="keyword">const</span> SortedTreeNodes::CornerIndices&amp; SortedTreeNodes::CornerTableData::operator[] ( <span class="keyword">const</span> TreeOctNode* node )<span class="keyword"> const </span>{ <span class="keywordflow">return</span> cTable[ node-&gt;nodeData.nodeIndex + offsets[node-&gt;d] ]; }</div>
<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;    SortedTreeNodes::CornerIndices&amp; SortedTreeNodes::CornerTableData::cornerIndices( <span class="keyword">const</span> TreeOctNode* node ) { <span class="keywordflow">return</span> cTable[ node-&gt;nodeData.nodeIndex + offsets[node-&gt;d] ]; }</div>
<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;    <span class="keyword">const</span> SortedTreeNodes::CornerIndices&amp; SortedTreeNodes::CornerTableData::cornerIndices( <span class="keyword">const</span> TreeOctNode* node )<span class="keyword"> const </span>{ <span class="keywordflow">return</span> cTable[ node-&gt;nodeData.nodeIndex + offsets[node-&gt;d] ]; }</div>
<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;    <span class="keywordtype">void</span> SortedTreeNodes::setCornerTable( CornerTableData&amp; cData , <span class="keyword">const</span> TreeOctNode* rootNode , <span class="keywordtype">int</span> maxDepth , <span class="keywordtype">int</span> threads )<span class="keyword"> const</span></div>
<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;      <span class="keywordflow">if</span>( threads&lt;=0 ) threads = 1;</div>
<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;      <span class="comment">// The vector of per-depth node spans</span></div>
<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;      std::vector&lt; std::pair&lt; int , int &gt; &gt; spans( this-&gt;maxDepth , std::pair&lt; int , int &gt;( -1 , -1 ) );</div>
<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;      <span class="keywordtype">int</span> minDepth , off[3];</div>
<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;      rootNode-&gt;depthAndOffset( minDepth , off );</div>
<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;      cData.offsets.resize( this-&gt;maxDepth , -1 );</div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;      <span class="keywordtype">int</span> nodeCount = 0;</div>
<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;      {</div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;        <span class="keywordtype">int</span> start=rootNode-&gt;nodeData.nodeIndex , end=start;</div>
<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=minDepth ; d&lt;=maxDepth ; d++ )</div>
<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;        {</div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;          spans[d] = std::pair&lt; int , int &gt;( start , end+1 );</div>
<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;          cData.offsets[d] = nodeCount - spans[d].first;</div>
<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;          nodeCount += spans[d].second - spans[d].first;</div>
<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;          <span class="keywordflow">if</span>( d&lt;maxDepth )</div>
<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;          {</div>
<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;            <span class="keywordflow">while</span>( start&lt; end &amp;&amp; !treeNodes[start]-&gt;children ) start++;</div>
<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;            <span class="keywordflow">while</span>( end&gt; start &amp;&amp; !treeNodes[end  ]-&gt;children ) end--;</div>
<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;            <span class="keywordflow">if</span>(    start==end &amp;&amp; !treeNodes[start]-&gt;children ) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;            start = treeNodes[start]-&gt;children[0].nodeData.nodeIndex;</div>
<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;            end   = treeNodes[end  ]-&gt;children[7].nodeData.nodeIndex;</div>
<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;          }</div>
<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;        }</div>
<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;      }</div>
<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;      cData.cTable.resize( nodeCount );</div>
<div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;      std::vector&lt; int &gt; count( threads );</div>
<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ )</div>
<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;      {</div>
<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;        TreeOctNode::ConstNeighborKey3 neighborKey;</div>
<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;        neighborKey.set( maxDepth );</div>
<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;        <span class="keywordtype">int</span> offset = nodeCount * t * Cube::CORNERS;</div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;        count[t] = 0;</div>
<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=minDepth ; d&lt;=maxDepth ; d++ )</div>
<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;        {</div>
<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;          <span class="keywordtype">int</span> start = spans[d].first , end = spans[d].second , width = end-start;</div>
<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=start + (width*t)/threads ; i&lt;start + (width*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;          {</div>
<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;            TreeOctNode* node = treeNodes[i];</div>
<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;            <span class="keywordflow">if</span>( d&lt;maxDepth &amp;&amp; node-&gt;children ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;            <span class="keyword">const</span> TreeOctNode::ConstNeighbors3&amp; neighbors = neighborKey.getNeighbors( node , minDepth );</div>
<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> c=0 ; c&lt;Cube::CORNERS ; c++ )  <span class="comment">// Iterate over the cell&#39;s corners</span></div>
<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;            {</div>
<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;              <span class="keywordtype">bool</span> cornerOwner = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;              <span class="keywordtype">int</span> x , y , z;</div>
<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;              <span class="keywordtype">int</span> ac = Cube::AntipodalCornerIndex( c ); <span class="comment">// The index of the node relative to the corner</span></div>
<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;              Cube::FactorCornerIndex( c , x , y , z );</div>
<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;              <span class="keywordflow">for</span>( <span class="keywordtype">int</span> cc=0 ; cc&lt;Cube::CORNERS ; cc++ ) <span class="comment">// Iterate over the corner&#39;s cells</span></div>
<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;              {</div>
<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;                <span class="keywordtype">int</span> xx , yy , zz;</div>
<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;                Cube::FactorCornerIndex( cc , xx , yy , zz );</div>
<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;                xx += x , yy += y , zz += z;</div>
<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;                <span class="keywordflow">if</span>( neighbors.neighbors[xx][yy][zz] )</div>
<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;                  <span class="keywordflow">if</span>( cc&lt;ac || ( d&lt;maxDepth &amp;&amp; neighbors.neighbors[xx][yy][zz]-&gt;children ) )</div>
<div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;                  {</div>
<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;                    <span class="keywordtype">int</span> _d , _off[3];</div>
<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;                    neighbors.neighbors[xx][yy][zz]-&gt;depthAndOffset( _d , _off );</div>
<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;                    _off[0] &gt;&gt;= (d-minDepth) , _off[1] &gt;&gt;= (d-minDepth) , _off[2] &gt;&gt;= (d-minDepth);</div>
<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;                    <span class="keywordflow">if</span>( _off[0]==off[0] &amp;&amp; _off[1]==off[1] &amp;&amp; _off[2]==off[2] )</div>
<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;                    {</div>
<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;                      cornerOwner = <span class="keyword">false</span>;</div>
<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;                      <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;                    }</div>
<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;                    <span class="keywordflow">else</span> fprintf( stderr , <span class="stringliteral">&quot;[WARNING] How did we leave the subtree?\n&quot;</span> );</div>
<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;                  }</div>
<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;              }</div>
<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;              <span class="keywordflow">if</span>( cornerOwner )</div>
<div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;              {</div>
<div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;                <span class="keyword">const</span> TreeOctNode* n = node;</div>
<div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;                <span class="keywordtype">int</span> d = n-&gt;depth();</div>
<div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;                <span class="keywordflow">do</span></div>
<div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;                {</div>
<div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;                  <span class="keyword">const</span> TreeOctNode::ConstNeighbors3&amp; neighbors = neighborKey.neighbors[d];</div>
<div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;                  <span class="comment">// Set all the corner indices at the current depth</span></div>
<div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;                  <span class="keywordflow">for</span>( <span class="keywordtype">int</span> cc=0 ; cc&lt;Cube::CORNERS ; cc++ )</div>
<div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;                  {</div>
<div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;                    <span class="keywordtype">int</span> xx , yy , zz;</div>
<div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;                    Cube::FactorCornerIndex( cc , xx , yy , zz );</div>
<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;                    xx += x , yy += y , zz += z;</div>
<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;                    <span class="keywordflow">if</span>( neighborKey.neighbors[d].neighbors[xx][yy][zz] )</div>
<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;                      cData[ neighbors.neighbors[xx][yy][zz] ][ Cube::AntipodalCornerIndex(cc) ] = count[t] + offset;</div>
<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;                  }</div>
<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;                  <span class="comment">// If we are not at the root and the parent also has the corner</span></div>
<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;                  <span class="keywordflow">if</span>( d==minDepth || n!=(n-&gt;parent-&gt;children+c) ) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;                  n = n-&gt;parent;</div>
<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;                  d--;</div>
<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;                }</div>
<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;                <span class="keywordflow">while</span>( 1 );</div>
<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;                count[t]++;</div>
<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;              }</div>
<div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;            }</div>
<div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;          }</div>
<div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;        }</div>
<div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;      }</div>
<div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;      cData.cCount = 0;</div>
<div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;      std::vector&lt; int &gt; offsets( threads+1 );</div>
<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;      offsets[0] = 0;</div>
<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ ) cData.cCount += count[t] , offsets[t+1] = offsets[t] + count[t];</div>
<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;#pragma omp parallel <span class="keywordflow">for</span> num_threads( threads )</div>
<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ )</div>
<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=minDepth ; d&lt;=maxDepth ; d++ )</div>
<div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;        {</div>
<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;          <span class="keywordtype">int</span> start = spans[d].first , end = spans[d].second , width = end - start;</div>
<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=start + (width*t)/threads ; i&lt;start+(width*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> c=0 ; c&lt;Cube::CORNERS ; c++ )</div>
<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;            {</div>
<div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;              <span class="keywordtype">int</span>&amp; idx = cData[ treeNodes[i] ][c];</div>
<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;              <span class="keywordflow">if</span>( idx&lt;0 )</div>
<div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;              {</div>
<div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;                fprintf( stderr , <span class="stringliteral">&quot;[ERROR] Found unindexed corner nodes[%d][%d] = %d (%d,%d)\n&quot;</span> , treeNodes[i]-&gt;nodeData.nodeIndex , c , idx , minDepth , maxDepth );</div>
<div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;                <span class="keywordtype">int</span> _d , _off[3];</div>
<div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;                treeNodes[i]-&gt;depthAndOffset( _d , _off );</div>
<div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;                printf( <span class="stringliteral">&quot;(%d [%d %d %d) &lt;-&gt; (%d [%d %d %d])\n&quot;</span> , minDepth , off[0] , off[1] , off[2] , _d , _off[0] , _off[1] , _off[2] );</div>
<div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;                printf( <span class="stringliteral">&quot;[%d %d]\n&quot;</span> , spans[d].first , spans[d].second );</div>
<div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;                exit( 0 );</div>
<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;              }</div>
<div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;              <span class="keywordflow">else</span></div>
<div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;              {</div>
<div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;                <span class="keywordtype">int</span> div = idx / ( nodeCount*Cube::CORNERS );</div>
<div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;                <span class="keywordtype">int</span> rem = idx % ( nodeCount*Cube::CORNERS );</div>
<div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;                idx = rem + offsets[div];</div>
<div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;              }</div>
<div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;            }</div>
<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;        }</div>
<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;    }</div>
<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;    <span class="keywordtype">int</span> SortedTreeNodes::getMaxCornerCount( <span class="keyword">const</span> TreeOctNode* rootNode , <span class="keywordtype">int</span> depth , <span class="keywordtype">int</span> maxDepth , <span class="keywordtype">int</span> threads )<span class="keyword"> const</span></div>
<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;      <span class="keywordflow">if</span>( threads&lt;=0 ) threads = 1;</div>
<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;      <span class="keywordtype">int</span> res = 1&lt;&lt;depth;</div>
<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;      std::vector&lt; std::vector&lt; int &gt; &gt; cornerCount( threads );</div>
<div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ ) cornerCount[t].resize( res*res*res , 0 );</div>
<div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160; </div>
<div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ )</div>
<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;      {</div>
<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;        std::vector&lt; int &gt;&amp; _cornerCount = cornerCount[t];</div>
<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;        TreeOctNode::ConstNeighborKey3 neighborKey;</div>
<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;        neighborKey.set( maxDepth );</div>
<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;        <span class="keywordtype">int</span> start = nodeCount[depth] , end = nodeCount[maxDepth+1] , range = end-start;</div>
<div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=(range*t)/threads ; i&lt;(range*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;        {</div>
<div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;          TreeOctNode* node = treeNodes[start+i];</div>
<div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;          <span class="keywordtype">int</span> d , off[3];</div>
<div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;          node-&gt;depthAndOffset( d , off );</div>
<div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;          <span class="keywordflow">if</span>( d&lt;maxDepth &amp;&amp; node-&gt;children ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160; </div>
<div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;          <span class="keyword">const</span> TreeOctNode::ConstNeighbors3&amp; neighbors = neighborKey.getNeighbors( node , depth );</div>
<div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> c=0 ; c&lt;Cube::CORNERS ; c++ )    <span class="comment">// Iterate over the cell&#39;s corners</span></div>
<div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;          {</div>
<div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;            <span class="keywordtype">bool</span> cornerOwner = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;            <span class="keywordtype">int</span> x , y , z;</div>
<div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;            <span class="keywordtype">int</span> ac = Cube::AntipodalCornerIndex( c ); <span class="comment">// The index of the node relative to the corner</span></div>
<div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;            Cube::FactorCornerIndex( c , x , y , z );</div>
<div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> cc=0 ; cc&lt;Cube::CORNERS ; cc++ ) <span class="comment">// Iterate over the corner&#39;s cells</span></div>
<div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;            {</div>
<div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;              <span class="keywordtype">int</span> xx , yy , zz;</div>
<div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;              Cube::FactorCornerIndex( cc , xx , yy , zz );</div>
<div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;              xx += x , yy += y , zz += z;</div>
<div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;              <span class="keywordflow">if</span>( neighbors.neighbors[xx][yy][zz] )</div>
<div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;                <span class="keywordflow">if</span>( cc&lt;ac || ( d&lt;maxDepth &amp;&amp; neighbors.neighbors[xx][yy][zz]-&gt;children ) )</div>
<div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;                {</div>
<div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;                  cornerOwner = <span class="keyword">false</span>;</div>
<div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;                  <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;                }</div>
<div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;            }</div>
<div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;            <span class="keywordflow">if</span>( cornerOwner ) _cornerCount[ ( ( off[0]&gt;&gt;(d-depth) ) * res * res) + ( ( off[1]&gt;&gt;(d-depth) ) * res) + ( off[2]&gt;&gt;(d-depth) ) ]++;</div>
<div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;          }</div>
<div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;        }</div>
<div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;      }</div>
<div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;      <span class="keywordtype">int</span> maxCount = 0;</div>
<div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;res*res*res ; i++ )</div>
<div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;      {</div>
<div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;        <span class="keywordtype">int</span> c = 0;</div>
<div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ ) c += cornerCount[t][i];</div>
<div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;        maxCount = std::max&lt; int &gt;( maxCount , c );</div>
<div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;      }</div>
<div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;      <span class="keywordflow">return</span> maxCount;</div>
<div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;    }</div>
<div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;    SortedTreeNodes::EdgeIndices&amp; SortedTreeNodes::EdgeTableData::operator[] ( <span class="keyword">const</span> TreeOctNode* node ) { <span class="keywordflow">return</span> eTable[ node-&gt;nodeData.nodeIndex + offsets[node-&gt;d] ]; }</div>
<div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;    <span class="keyword">const</span> SortedTreeNodes::EdgeIndices&amp; SortedTreeNodes::EdgeTableData::operator[] ( <span class="keyword">const</span> TreeOctNode* node )<span class="keyword"> const </span>{ <span class="keywordflow">return</span> eTable[ node-&gt;nodeData.nodeIndex + offsets[node-&gt;d] ]; }</div>
<div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;    SortedTreeNodes::EdgeIndices&amp; SortedTreeNodes::EdgeTableData::edgeIndices( <span class="keyword">const</span> TreeOctNode* node ) { <span class="keywordflow">return</span> eTable[ node-&gt;nodeData.nodeIndex + offsets[node-&gt;d] ]; }</div>
<div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;    <span class="keyword">const</span> SortedTreeNodes::EdgeIndices&amp; SortedTreeNodes::EdgeTableData::edgeIndices( <span class="keyword">const</span> TreeOctNode* node )<span class="keyword"> const </span>{ <span class="keywordflow">return</span> eTable[ node-&gt;nodeData.nodeIndex + offsets[node-&gt;d] ]; }</div>
<div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;    <span class="keywordtype">void</span> SortedTreeNodes::setEdgeTable( EdgeTableData&amp; eData , <span class="keyword">const</span> TreeOctNode* rootNode , <span class="keywordtype">int</span> maxDepth , <span class="keywordtype">int</span> threads )</div>
<div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;    {</div>
<div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;      <span class="keywordflow">if</span>( threads&lt;=0 ) threads = 1;</div>
<div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;      std::vector&lt; std::pair&lt; int , int &gt; &gt; spans( this-&gt;maxDepth , std::pair&lt; int , int &gt;( -1 , -1 ) );</div>
<div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160; </div>
<div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;      <span class="keywordtype">int</span> minDepth , off[3];</div>
<div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;      rootNode-&gt;depthAndOffset( minDepth , off );</div>
<div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;      eData.offsets.resize( this-&gt;maxDepth , -1 );</div>
<div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;      <span class="keywordtype">int</span> nodeCount = 0;</div>
<div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;      {</div>
<div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;        <span class="keywordtype">int</span> start=rootNode-&gt;nodeData.nodeIndex , end=start;</div>
<div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=minDepth ; d&lt;=maxDepth ; d++ )</div>
<div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;        {</div>
<div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;          spans[d] = std::pair&lt; int , int &gt;( start , end+1 );</div>
<div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;          eData.offsets[d] = nodeCount - spans[d].first;</div>
<div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;          nodeCount += spans[d].second - spans[d].first;</div>
<div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;          <span class="keywordflow">if</span>( d&lt;maxDepth )</div>
<div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;          {</div>
<div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;            <span class="keywordflow">while</span>( start&lt; end &amp;&amp; !treeNodes[start]-&gt;children ) start++;</div>
<div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;            <span class="keywordflow">while</span>( end&gt; start &amp;&amp; !treeNodes[end  ]-&gt;children ) end--;</div>
<div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;            <span class="keywordflow">if</span>(    start==end &amp;&amp; !treeNodes[start]-&gt;children ) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;            start = treeNodes[start]-&gt;children[0].nodeData.nodeIndex;</div>
<div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;            end   = treeNodes[end  ]-&gt;children[7].nodeData.nodeIndex;</div>
<div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;          }</div>
<div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;        }</div>
<div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;      }</div>
<div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;      eData.eTable.resize( nodeCount );</div>
<div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;      std::vector&lt; int &gt; count( threads );</div>
<div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ )</div>
<div class="line"><a name="l00337"></a><span class="lineno">  337</span>&#160;      {</div>
<div class="line"><a name="l00338"></a><span class="lineno">  338</span>&#160;        TreeOctNode::ConstNeighborKey3 neighborKey;</div>
<div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160;        neighborKey.set( maxDepth );</div>
<div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;        <span class="keywordtype">int</span> offset = nodeCount * t * Cube::EDGES;</div>
<div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;        count[t] = 0;</div>
<div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=minDepth ; d&lt;=maxDepth ; d++ )</div>
<div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;        {</div>
<div class="line"><a name="l00344"></a><span class="lineno">  344</span>&#160;          <span class="keywordtype">int</span> start = spans[d].first , end = spans[d].second , width = end-start;</div>
<div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=start + (width*t)/threads ; i&lt;start + (width*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;          {</div>
<div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;            TreeOctNode* node = treeNodes[i];</div>
<div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160;            <span class="keyword">const</span> TreeOctNode::ConstNeighbors3&amp; neighbors = neighborKey.getNeighbors( node , minDepth );</div>
<div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160; </div>
<div class="line"><a name="l00350"></a><span class="lineno">  350</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> e=0 ; e&lt;Cube::EDGES ; e++ )</div>
<div class="line"><a name="l00351"></a><span class="lineno">  351</span>&#160;            {</div>
<div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;              <span class="keywordtype">bool</span> edgeOwner = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160;              <span class="keywordtype">int</span> o , i , j;</div>
<div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;              Cube::FactorEdgeIndex( e , o , i , j );</div>
<div class="line"><a name="l00355"></a><span class="lineno">  355</span>&#160;              <span class="keywordtype">int</span> ac = Square::AntipodalCornerIndex( Square::CornerIndex( i , j ) );</div>
<div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;              <span class="keywordflow">for</span>( <span class="keywordtype">int</span> cc=0 ; cc&lt;Square::CORNERS ; cc++ )</div>
<div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;              {</div>
<div class="line"><a name="l00358"></a><span class="lineno">  358</span>&#160;                <span class="keywordtype">int</span> ii , jj , x , y , z;</div>
<div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;                Square::FactorCornerIndex( cc , ii , jj );</div>
<div class="line"><a name="l00360"></a><span class="lineno">  360</span>&#160;                ii += i , jj += j;</div>
<div class="line"><a name="l00361"></a><span class="lineno">  361</span>&#160;                <span class="keywordflow">switch</span>( o )</div>
<div class="line"><a name="l00362"></a><span class="lineno">  362</span>&#160;                {</div>
<div class="line"><a name="l00363"></a><span class="lineno">  363</span>&#160;                <span class="keywordflow">case</span> 0: y = ii , z = jj , x = 1 ; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00364"></a><span class="lineno">  364</span>&#160;                <span class="keywordflow">case</span> 1: x = ii , z = jj , y = 1 ; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00365"></a><span class="lineno">  365</span>&#160;                <span class="keywordflow">case</span> 2: x = ii , y = jj , z = 1 ; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;                }</div>
<div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;                <span class="keywordflow">if</span>( neighbors.neighbors[x][y][z] &amp;&amp; cc&lt;ac ) { edgeOwner = false ; <span class="keywordflow">break</span>; }</div>
<div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;              }</div>
<div class="line"><a name="l00369"></a><span class="lineno">  369</span>&#160;              <span class="keywordflow">if</span>( edgeOwner )</div>
<div class="line"><a name="l00370"></a><span class="lineno">  370</span>&#160;              {</div>
<div class="line"><a name="l00371"></a><span class="lineno">  371</span>&#160;                <span class="comment">// Set all edge indices</span></div>
<div class="line"><a name="l00372"></a><span class="lineno">  372</span>&#160;                <span class="keywordflow">for</span>( <span class="keywordtype">int</span> cc=0 ; cc&lt;Square::CORNERS ; cc++ )</div>
<div class="line"><a name="l00373"></a><span class="lineno">  373</span>&#160;                {</div>
<div class="line"><a name="l00374"></a><span class="lineno">  374</span>&#160;                  <span class="keywordtype">int</span> ii , jj , aii , ajj , x , y , z;</div>
<div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;                  Square::FactorCornerIndex( cc , ii , jj );</div>
<div class="line"><a name="l00376"></a><span class="lineno">  376</span>&#160;                  Square::FactorCornerIndex( Square::AntipodalCornerIndex( cc ) , aii , ajj );</div>
<div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;                  ii += i , jj += j;</div>
<div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160;                  <span class="keywordflow">switch</span>( o )</div>
<div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;                  {</div>
<div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;                  <span class="keywordflow">case</span> 0: y = ii , z = jj , x = 1 ; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;                  <span class="keywordflow">case</span> 1: x = ii , z = jj , y = 1 ; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;                  <span class="keywordflow">case</span> 2: x = ii , y = jj , z = 1 ; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;                  }</div>
<div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;                  <span class="keywordflow">if</span>( neighbors.neighbors[x][y][z] )</div>
<div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;                    eData[ neighbors.neighbors[x][y][z] ][ Cube::EdgeIndex( o , aii , ajj ) ] = count[t]+offset;</div>
<div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;                }</div>
<div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;                count[t]++;</div>
<div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;              }</div>
<div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;            }</div>
<div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;          }</div>
<div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;        }</div>
<div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;      }</div>
<div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;      eData.eCount = 0;</div>
<div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;      std::vector&lt; int &gt; offsets( threads+1 );</div>
<div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;      offsets[0] = 0;</div>
<div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ ) eData.eCount += count[t] , offsets[t+1] = offsets[t] + count[t];</div>
<div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;#pragma omp parallel <span class="keywordflow">for</span> num_threads( threads )</div>
<div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ )</div>
<div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=minDepth ; d&lt;=maxDepth ; d++ )</div>
<div class="line"><a name="l00400"></a><span class="lineno">  400</span>&#160;        {</div>
<div class="line"><a name="l00401"></a><span class="lineno">  401</span>&#160;          <span class="keywordtype">int</span> start = spans[d].first , end = spans[d].second , width = end - start;</div>
<div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=start + (width*t)/threads ; i&lt;start+(width*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l00403"></a><span class="lineno">  403</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> e=0 ; e&lt;Cube::EDGES ; e++ )</div>
<div class="line"><a name="l00404"></a><span class="lineno">  404</span>&#160;            {</div>
<div class="line"><a name="l00405"></a><span class="lineno">  405</span>&#160;              <span class="keywordtype">int</span>&amp; idx = eData[ treeNodes[i] ][e];</div>
<div class="line"><a name="l00406"></a><span class="lineno">  406</span>&#160;              <span class="keywordflow">if</span>( idx&lt;0 ) fprintf( stderr , <span class="stringliteral">&quot;[ERROR] Found unindexed edge %d (%d,%d)\n&quot;</span> , idx , minDepth , maxDepth ) , exit( 0 );</div>
<div class="line"><a name="l00407"></a><span class="lineno">  407</span>&#160;              <span class="keywordflow">else</span></div>
<div class="line"><a name="l00408"></a><span class="lineno">  408</span>&#160;              {</div>
<div class="line"><a name="l00409"></a><span class="lineno">  409</span>&#160;                <span class="keywordtype">int</span> div = idx / ( nodeCount*Cube::EDGES );</div>
<div class="line"><a name="l00410"></a><span class="lineno">  410</span>&#160;                <span class="keywordtype">int</span> rem = idx % ( nodeCount*Cube::EDGES );</div>
<div class="line"><a name="l00411"></a><span class="lineno">  411</span>&#160;                idx = rem + offsets[div];</div>
<div class="line"><a name="l00412"></a><span class="lineno">  412</span>&#160;              }</div>
<div class="line"><a name="l00413"></a><span class="lineno">  413</span>&#160;            }</div>
<div class="line"><a name="l00414"></a><span class="lineno">  414</span>&#160;        }</div>
<div class="line"><a name="l00415"></a><span class="lineno">  415</span>&#160;    }</div>
<div class="line"><a name="l00416"></a><span class="lineno">  416</span>&#160;    <span class="keywordtype">int</span> SortedTreeNodes::getMaxEdgeCount( <span class="keyword">const</span> TreeOctNode* rootNode , <span class="keywordtype">int</span> depth , <span class="keywordtype">int</span> threads )<span class="keyword"> const</span></div>
<div class="line"><a name="l00417"></a><span class="lineno">  417</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00418"></a><span class="lineno">  418</span>&#160;      <span class="keywordflow">if</span>( threads&lt;=0 ) threads = 1;</div>
<div class="line"><a name="l00419"></a><span class="lineno">  419</span>&#160;      <span class="keywordtype">int</span> res = 1&lt;&lt;depth;</div>
<div class="line"><a name="l00420"></a><span class="lineno">  420</span>&#160;      std::vector&lt; std::vector&lt; int &gt; &gt; edgeCount( threads );</div>
<div class="line"><a name="l00421"></a><span class="lineno">  421</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ ) edgeCount[t].resize( res*res*res , 0 );</div>
<div class="line"><a name="l00422"></a><span class="lineno">  422</span>&#160; </div>
<div class="line"><a name="l00423"></a><span class="lineno">  423</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l00424"></a><span class="lineno">  424</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ )</div>
<div class="line"><a name="l00425"></a><span class="lineno">  425</span>&#160;      {</div>
<div class="line"><a name="l00426"></a><span class="lineno">  426</span>&#160;        std::vector&lt; int &gt;&amp; _edgeCount = edgeCount[t];</div>
<div class="line"><a name="l00427"></a><span class="lineno">  427</span>&#160;        TreeOctNode::ConstNeighborKey3 neighborKey;</div>
<div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;        neighborKey.set( maxDepth-1 );</div>
<div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160;        <span class="keywordtype">int</span> start = nodeCount[depth] , end = nodeCount[maxDepth] , range = end-start;</div>
<div class="line"><a name="l00430"></a><span class="lineno">  430</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=(range*t)/threads ; i&lt;(range*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160;        {</div>
<div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160;          TreeOctNode* node = treeNodes[start+i];</div>
<div class="line"><a name="l00433"></a><span class="lineno">  433</span>&#160;          <span class="keyword">const</span> TreeOctNode::ConstNeighbors3&amp; neighbors = neighborKey.getNeighbors( node , depth );</div>
<div class="line"><a name="l00434"></a><span class="lineno">  434</span>&#160;          <span class="keywordtype">int</span> d , off[3];</div>
<div class="line"><a name="l00435"></a><span class="lineno">  435</span>&#160;          node-&gt;depthAndOffset( d , off );</div>
<div class="line"><a name="l00436"></a><span class="lineno">  436</span>&#160; </div>
<div class="line"><a name="l00437"></a><span class="lineno">  437</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> e=0 ; e&lt;Cube::EDGES ; e++ )</div>
<div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;          {</div>
<div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160;            <span class="keywordtype">bool</span> edgeOwner = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;            <span class="keywordtype">int</span> o , i , j;</div>
<div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;            Cube::FactorEdgeIndex( e , o , i , j );</div>
<div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160;            <span class="keywordtype">int</span> ac = Square::AntipodalCornerIndex( Square::CornerIndex( i , j ) );</div>
<div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> cc=0 ; cc&lt;Square::CORNERS ; cc++ )</div>
<div class="line"><a name="l00444"></a><span class="lineno">  444</span>&#160;            {</div>
<div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160;              <span class="keywordtype">int</span> ii , jj , x , y , z;</div>
<div class="line"><a name="l00446"></a><span class="lineno">  446</span>&#160;              Square::FactorCornerIndex( cc , ii , jj );</div>
<div class="line"><a name="l00447"></a><span class="lineno">  447</span>&#160;              ii += i , jj += j;</div>
<div class="line"><a name="l00448"></a><span class="lineno">  448</span>&#160;              <span class="keywordflow">switch</span>( o )</div>
<div class="line"><a name="l00449"></a><span class="lineno">  449</span>&#160;              {</div>
<div class="line"><a name="l00450"></a><span class="lineno">  450</span>&#160;              <span class="keywordflow">case</span> 0: y = ii , z = jj , x = 1 ; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00451"></a><span class="lineno">  451</span>&#160;              <span class="keywordflow">case</span> 1: x = ii , z = jj , y = 1 ; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160;              <span class="keywordflow">case</span> 2: x = ii , y = jj , z = 1 ; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00453"></a><span class="lineno">  453</span>&#160;              }</div>
<div class="line"><a name="l00454"></a><span class="lineno">  454</span>&#160;              <span class="keywordflow">if</span>( neighbors.neighbors[x][y][z] &amp;&amp; cc&lt;ac ) { edgeOwner = false ; <span class="keywordflow">break</span>; }</div>
<div class="line"><a name="l00455"></a><span class="lineno">  455</span>&#160;            }</div>
<div class="line"><a name="l00456"></a><span class="lineno">  456</span>&#160;            <span class="keywordflow">if</span>( edgeOwner ) _edgeCount[ ( ( off[0]&gt;&gt;(d-depth) ) * res * res) + ( ( off[1]&gt;&gt;(d-depth) ) * res) + ( off[2]&gt;&gt;(d-depth) ) ]++;</div>
<div class="line"><a name="l00457"></a><span class="lineno">  457</span>&#160;          }</div>
<div class="line"><a name="l00458"></a><span class="lineno">  458</span>&#160;        }</div>
<div class="line"><a name="l00459"></a><span class="lineno">  459</span>&#160;      }</div>
<div class="line"><a name="l00460"></a><span class="lineno">  460</span>&#160;      <span class="keywordtype">int</span> maxCount = 0;</div>
<div class="line"><a name="l00461"></a><span class="lineno">  461</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;res*res*res ; i++ )</div>
<div class="line"><a name="l00462"></a><span class="lineno">  462</span>&#160;      {</div>
<div class="line"><a name="l00463"></a><span class="lineno">  463</span>&#160;        <span class="keywordtype">int</span> c = 0;</div>
<div class="line"><a name="l00464"></a><span class="lineno">  464</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ ) c += edgeCount[t][i];</div>
<div class="line"><a name="l00465"></a><span class="lineno">  465</span>&#160;        maxCount = std::max&lt; int &gt;( maxCount , c );</div>
<div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160;      }</div>
<div class="line"><a name="l00467"></a><span class="lineno">  467</span>&#160;      <span class="keywordflow">return</span> maxCount;</div>
<div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160;    }</div>
<div class="line"><a name="l00469"></a><span class="lineno">  469</span>&#160; </div>
<div class="line"><a name="l00470"></a><span class="lineno">  470</span>&#160; </div>
<div class="line"><a name="l00471"></a><span class="lineno">  471</span>&#160; </div>
<div class="line"><a name="l00473"></a><span class="lineno">  473</span>&#160;    <span class="comment">// TreeNodeData //</span></div>
<div class="line"><a name="l00475"></a><span class="lineno">  475</span>&#160;<span class="comment"></span>    <span class="keywordtype">int</span> TreeNodeData::UseIndex=1;</div>
<div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;    TreeNodeData::TreeNodeData( <span class="keywordtype">void</span> )</div>
<div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160;    {</div>
<div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;      <span class="keywordflow">if</span>( UseIndex )</div>
<div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160;      {</div>
<div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;        nodeIndex = -1;</div>
<div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160;        centerWeightContribution=0;</div>
<div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;      }</div>
<div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;      <span class="keywordflow">else</span> mcIndex=0;</div>
<div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;      normalIndex = -1;</div>
<div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;      constraint = solution = 0;</div>
<div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;      pointIndex = -1;</div>
<div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;    }</div>
<div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;    TreeNodeData::~TreeNodeData( <span class="keywordtype">void</span> ) { }</div>
<div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160; </div>
<div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160; </div>
<div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;    <span class="comment">// Octree //</span></div>
<div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;<span class="comment"></span>    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;    <span class="keywordtype">double</span> Octree&lt;Degree&gt;::maxMemoryUsage=0;</div>
<div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160; </div>
<div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160; </div>
<div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160; </div>
<div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;    <span class="keywordtype">double</span> Octree&lt;Degree&gt;::MemoryUsage(<span class="keywordtype">void</span>){</div>
<div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;      <span class="keywordtype">double</span> mem = 0;<span class="comment">//double( MemoryInfo::Usage() ) / (1&lt;&lt;20);</span></div>
<div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;      <span class="keywordflow">if</span>(mem&gt;maxMemoryUsage){maxMemoryUsage=mem;}</div>
<div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;      <span class="keywordflow">return</span> mem;</div>
<div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;    }</div>
<div class="line"><a name="l00505"></a><span class="lineno">  505</span>&#160; </div>
<div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;    Octree&lt;Degree&gt;::Octree(<span class="keywordtype">void</span>)</div>
<div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;    {</div>
<div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160;      threads = 1;</div>
<div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;      radius = 0;</div>
<div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;      width = 0;</div>
<div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;      postNormalSmooth = 0;</div>
<div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;      _constrainValues = <span class="keyword">false</span>;</div>
<div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;    }</div>
<div class="line"><a name="l00515"></a><span class="lineno">  515</span>&#160; </div>
<div class="line"><a name="l00516"></a><span class="lineno">  516</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l00517"></a><span class="lineno">  517</span>&#160;    <span class="keywordtype">int</span> Octree&lt;Degree&gt;::NonLinearSplatOrientedPoint( TreeOctNode* node , <span class="keyword">const</span> <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;Real&gt;</a>&amp; position , <span class="keyword">const</span> <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;Real&gt;</a>&amp; normal )</div>
<div class="line"><a name="l00518"></a><span class="lineno">  518</span>&#160;    {</div>
<div class="line"><a name="l00519"></a><span class="lineno">  519</span>&#160;      <span class="keywordtype">double</span> x , dxdy , dxdydz , dx[DIMENSION][SPLAT_ORDER+1];</div>
<div class="line"><a name="l00520"></a><span class="lineno">  520</span>&#160;      <span class="keywordtype">int</span> off[3];</div>
<div class="line"><a name="l00521"></a><span class="lineno">  521</span>&#160;      TreeOctNode::Neighbors3&amp; neighbors = neighborKey.setNeighbors( node );</div>
<div class="line"><a name="l00522"></a><span class="lineno">  522</span>&#160;      <span class="keywordtype">double</span> width;</div>
<div class="line"><a name="l00523"></a><span class="lineno">  523</span>&#160;      <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;Real&gt;</a> center;</div>
<div class="line"><a name="l00524"></a><span class="lineno">  524</span>&#160;      Real w;</div>
<div class="line"><a name="l00525"></a><span class="lineno">  525</span>&#160;      node-&gt;centerAndWidth( center , w );</div>
<div class="line"><a name="l00526"></a><span class="lineno">  526</span>&#160;      width=w;</div>
<div class="line"><a name="l00527"></a><span class="lineno">  527</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;3 ; i++ )</div>
<div class="line"><a name="l00528"></a><span class="lineno">  528</span>&#160;      {</div>
<div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;<span class="preprocessor">#if SPLAT_ORDER==2</span></div>
<div class="line"><a name="l00530"></a><span class="lineno">  530</span>&#160;        off[i] = 0;</div>
<div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;        x = ( center[i] - position[i] - width ) / width;</div>
<div class="line"><a name="l00532"></a><span class="lineno">  532</span>&#160;        dx[i][0] = 1.125+1.500*x+0.500*x*x;</div>
<div class="line"><a name="l00533"></a><span class="lineno">  533</span>&#160;        x = ( center[i] - position[i] ) / width;</div>
<div class="line"><a name="l00534"></a><span class="lineno">  534</span>&#160;        dx[i][1] = 0.750        -      x*x;</div>
<div class="line"><a name="l00535"></a><span class="lineno">  535</span>&#160; </div>
<div class="line"><a name="l00536"></a><span class="lineno">  536</span>&#160;        dx[i][2] = 1. - dx[i][1] - dx[i][0];</div>
<div class="line"><a name="l00537"></a><span class="lineno">  537</span>&#160;<span class="preprocessor">#elif SPLAT_ORDER==1</span></div>
<div class="line"><a name="l00538"></a><span class="lineno">  538</span>&#160;        x = ( position[i] - center[i] ) / width;</div>
<div class="line"><a name="l00539"></a><span class="lineno">  539</span>&#160;        <span class="keywordflow">if</span>( x&lt;0 )</div>
<div class="line"><a name="l00540"></a><span class="lineno">  540</span>&#160;        {</div>
<div class="line"><a name="l00541"></a><span class="lineno">  541</span>&#160;          off[i] = 0;</div>
<div class="line"><a name="l00542"></a><span class="lineno">  542</span>&#160;          dx[i][0] = -x;</div>
<div class="line"><a name="l00543"></a><span class="lineno">  543</span>&#160;        }</div>
<div class="line"><a name="l00544"></a><span class="lineno">  544</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l00545"></a><span class="lineno">  545</span>&#160;        {</div>
<div class="line"><a name="l00546"></a><span class="lineno">  546</span>&#160;          off[i] = 1;</div>
<div class="line"><a name="l00547"></a><span class="lineno">  547</span>&#160;          dx[i][0] = 1. - x;</div>
<div class="line"><a name="l00548"></a><span class="lineno">  548</span>&#160;        }</div>
<div class="line"><a name="l00549"></a><span class="lineno">  549</span>&#160;        dx[i][1] = 1. - dx[i][0];</div>
<div class="line"><a name="l00550"></a><span class="lineno">  550</span>&#160;<span class="preprocessor">#elif SPLAT_ORDER==0</span></div>
<div class="line"><a name="l00551"></a><span class="lineno">  551</span>&#160;        off[i] = 1;</div>
<div class="line"><a name="l00552"></a><span class="lineno">  552</span>&#160;        dx[i][0] = 1.;</div>
<div class="line"><a name="l00553"></a><span class="lineno">  553</span>&#160;<span class="preprocessor">#else</span></div>
<div class="line"><a name="l00554"></a><span class="lineno">  554</span>&#160;<span class="preprocessor">#     error Splat order not supported</span></div>
<div class="line"><a name="l00555"></a><span class="lineno">  555</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// SPLAT_ORDER</span></div>
<div class="line"><a name="l00556"></a><span class="lineno">  556</span>&#160;      }</div>
<div class="line"><a name="l00557"></a><span class="lineno">  557</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=off[0] ; i&lt;=off[0]+SPLAT_ORDER ; i++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=off[1] ; j&lt;=off[1]+SPLAT_ORDER ; j++ )</div>
<div class="line"><a name="l00558"></a><span class="lineno">  558</span>&#160;      {</div>
<div class="line"><a name="l00559"></a><span class="lineno">  559</span>&#160;        dxdy = dx[0][i] * dx[1][j];</div>
<div class="line"><a name="l00560"></a><span class="lineno">  560</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> k=off[2] ; k&lt;=off[2]+SPLAT_ORDER ; k++ )</div>
<div class="line"><a name="l00561"></a><span class="lineno">  561</span>&#160;          <span class="keywordflow">if</span>( neighbors.neighbors[i][j][k] )</div>
<div class="line"><a name="l00562"></a><span class="lineno">  562</span>&#160;          {</div>
<div class="line"><a name="l00563"></a><span class="lineno">  563</span>&#160;            dxdydz = dxdy * dx[2][k];</div>
<div class="line"><a name="l00564"></a><span class="lineno">  564</span>&#160;            TreeOctNode* _node = neighbors.neighbors[i][j][k];</div>
<div class="line"><a name="l00565"></a><span class="lineno">  565</span>&#160;            <span class="keywordtype">int</span> idx =_node-&gt;nodeData.normalIndex;</div>
<div class="line"><a name="l00566"></a><span class="lineno">  566</span>&#160;            <span class="keywordflow">if</span>( idx&lt;0 )</div>
<div class="line"><a name="l00567"></a><span class="lineno">  567</span>&#160;            {</div>
<div class="line"><a name="l00568"></a><span class="lineno">  568</span>&#160;              <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;Real&gt;</a> n;</div>
<div class="line"><a name="l00569"></a><span class="lineno">  569</span>&#160;              n[0] = n[1] = n[2] = 0;</div>
<div class="line"><a name="l00570"></a><span class="lineno">  570</span>&#160;              _node-&gt;nodeData.nodeIndex = 0;</div>
<div class="line"><a name="l00571"></a><span class="lineno">  571</span>&#160;              idx = _node-&gt;nodeData.normalIndex = int(normals-&gt;size());</div>
<div class="line"><a name="l00572"></a><span class="lineno">  572</span>&#160;              normals-&gt;push_back(n);</div>
<div class="line"><a name="l00573"></a><span class="lineno">  573</span>&#160;            }</div>
<div class="line"><a name="l00574"></a><span class="lineno">  574</span>&#160;            (*normals)[idx] += normal * Real( dxdydz );</div>
<div class="line"><a name="l00575"></a><span class="lineno">  575</span>&#160;          }</div>
<div class="line"><a name="l00576"></a><span class="lineno">  576</span>&#160;      }</div>
<div class="line"><a name="l00577"></a><span class="lineno">  577</span>&#160;      <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00578"></a><span class="lineno">  578</span>&#160;    }</div>
<div class="line"><a name="l00579"></a><span class="lineno">  579</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l00580"></a><span class="lineno">  580</span>&#160;    Real Octree&lt;Degree&gt;::NonLinearSplatOrientedPoint( <span class="keyword">const</span> <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;Real&gt;</a>&amp; position , <span class="keyword">const</span> <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;Real&gt;</a>&amp; normal , <span class="keywordtype">int</span> splatDepth , Real samplesPerNode ,</div>
<div class="line"><a name="l00581"></a><span class="lineno">  581</span>&#160;                                                      <span class="keywordtype">int</span> minDepth , <span class="keywordtype">int</span> maxDepth )</div>
<div class="line"><a name="l00582"></a><span class="lineno">  582</span>&#160;    {</div>
<div class="line"><a name="l00583"></a><span class="lineno">  583</span>&#160;      <span class="keywordtype">double</span> dx;</div>
<div class="line"><a name="l00584"></a><span class="lineno">  584</span>&#160;      <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;Real&gt;</a> n;</div>
<div class="line"><a name="l00585"></a><span class="lineno">  585</span>&#160;      TreeOctNode* temp;</div>
<div class="line"><a name="l00586"></a><span class="lineno">  586</span>&#160;      <span class="keywordtype">int</span> cnt=0;</div>
<div class="line"><a name="l00587"></a><span class="lineno">  587</span>&#160;      <span class="keywordtype">double</span> width;</div>
<div class="line"><a name="l00588"></a><span class="lineno">  588</span>&#160;      <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> myCenter;</div>
<div class="line"><a name="l00589"></a><span class="lineno">  589</span>&#160;      Real myWidth;</div>
<div class="line"><a name="l00590"></a><span class="lineno">  590</span>&#160;      myCenter[0] = myCenter[1] = myCenter[2] = Real(0.5);</div>
<div class="line"><a name="l00591"></a><span class="lineno">  591</span>&#160;      myWidth = Real(1.0);</div>
<div class="line"><a name="l00592"></a><span class="lineno">  592</span>&#160; </div>
<div class="line"><a name="l00593"></a><span class="lineno">  593</span>&#160;      temp = &amp;tree;</div>
<div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;      <span class="keywordflow">while</span>( temp-&gt;depth()&lt;splatDepth )</div>
<div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;      {</div>
<div class="line"><a name="l00596"></a><span class="lineno">  596</span>&#160;        <span class="keywordflow">if</span>( !temp-&gt;children )</div>
<div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160;        {</div>
<div class="line"><a name="l00598"></a><span class="lineno">  598</span>&#160;          fprintf( stderr , <span class="stringliteral">&quot;Octree&lt;Degree&gt;::NonLinearSplatOrientedPoint error\n&quot;</span> );</div>
<div class="line"><a name="l00599"></a><span class="lineno">  599</span>&#160;          <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;        }</div>
<div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;        <span class="keywordtype">int</span> cIndex=TreeOctNode::CornerIndex(myCenter,position);</div>
<div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;        temp=&amp;temp-&gt;children[cIndex];</div>
<div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;        myWidth/=2;</div>
<div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160;        <span class="keywordflow">if</span>(cIndex&amp;1) myCenter[0] += myWidth/2;</div>
<div class="line"><a name="l00605"></a><span class="lineno">  605</span>&#160;        <span class="keywordflow">else</span>         myCenter[0] -= myWidth/2;</div>
<div class="line"><a name="l00606"></a><span class="lineno">  606</span>&#160;        <span class="keywordflow">if</span>(cIndex&amp;2) myCenter[1] += myWidth/2;</div>
<div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;        <span class="keywordflow">else</span>         myCenter[1] -= myWidth/2;</div>
<div class="line"><a name="l00608"></a><span class="lineno">  608</span>&#160;        <span class="keywordflow">if</span>(cIndex&amp;4) myCenter[2] += myWidth/2;</div>
<div class="line"><a name="l00609"></a><span class="lineno">  609</span>&#160;        <span class="keywordflow">else</span>         myCenter[2] -= myWidth/2;</div>
<div class="line"><a name="l00610"></a><span class="lineno">  610</span>&#160;      }</div>
<div class="line"><a name="l00611"></a><span class="lineno">  611</span>&#160;      Real alpha,newDepth;</div>
<div class="line"><a name="l00612"></a><span class="lineno">  612</span>&#160;      NonLinearGetSampleDepthAndWeight( temp , position , samplesPerNode , newDepth , alpha );</div>
<div class="line"><a name="l00613"></a><span class="lineno">  613</span>&#160; </div>
<div class="line"><a name="l00614"></a><span class="lineno">  614</span>&#160;      <span class="keywordflow">if</span>( newDepth&lt;minDepth ) newDepth=Real(minDepth);</div>
<div class="line"><a name="l00615"></a><span class="lineno">  615</span>&#160;      <span class="keywordflow">if</span>( newDepth&gt;maxDepth ) newDepth=Real(maxDepth);</div>
<div class="line"><a name="l00616"></a><span class="lineno">  616</span>&#160;      <span class="keywordtype">int</span> topDepth=int(ceil(newDepth));</div>
<div class="line"><a name="l00617"></a><span class="lineno">  617</span>&#160; </div>
<div class="line"><a name="l00618"></a><span class="lineno">  618</span>&#160;      dx = 1.0-(topDepth-newDepth);</div>
<div class="line"><a name="l00619"></a><span class="lineno">  619</span>&#160;      <span class="keywordflow">if</span>( topDepth&lt;=minDepth )</div>
<div class="line"><a name="l00620"></a><span class="lineno">  620</span>&#160;      {</div>
<div class="line"><a name="l00621"></a><span class="lineno">  621</span>&#160;        topDepth=minDepth;</div>
<div class="line"><a name="l00622"></a><span class="lineno">  622</span>&#160;        dx=1;</div>
<div class="line"><a name="l00623"></a><span class="lineno">  623</span>&#160;      }</div>
<div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;      <span class="keywordflow">else</span> <span class="keywordflow">if</span>( topDepth&gt;maxDepth )</div>
<div class="line"><a name="l00625"></a><span class="lineno">  625</span>&#160;      {</div>
<div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160;        topDepth=maxDepth;</div>
<div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;        dx=1;</div>
<div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;      }</div>
<div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;      <span class="keywordflow">while</span>( temp-&gt;depth()&gt;topDepth ) temp=temp-&gt;parent;</div>
<div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;      <span class="keywordflow">while</span>( temp-&gt;depth()&lt;topDepth )</div>
<div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;      {</div>
<div class="line"><a name="l00632"></a><span class="lineno">  632</span>&#160;        <span class="keywordflow">if</span>(!temp-&gt;children) temp-&gt;initChildren();</div>
<div class="line"><a name="l00633"></a><span class="lineno">  633</span>&#160;        <span class="keywordtype">int</span> cIndex=TreeOctNode::CornerIndex(myCenter,position);</div>
<div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;        temp=&amp;temp-&gt;children[cIndex];</div>
<div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160;        myWidth/=2;</div>
<div class="line"><a name="l00636"></a><span class="lineno">  636</span>&#160;        <span class="keywordflow">if</span>(cIndex&amp;1) myCenter[0] += myWidth/2;</div>
<div class="line"><a name="l00637"></a><span class="lineno">  637</span>&#160;        <span class="keywordflow">else</span>         myCenter[0] -= myWidth/2;</div>
<div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;        <span class="keywordflow">if</span>(cIndex&amp;2) myCenter[1] += myWidth/2;</div>
<div class="line"><a name="l00639"></a><span class="lineno">  639</span>&#160;        <span class="keywordflow">else</span>         myCenter[1] -= myWidth/2;</div>
<div class="line"><a name="l00640"></a><span class="lineno">  640</span>&#160;        <span class="keywordflow">if</span>(cIndex&amp;4) myCenter[2] += myWidth/2;</div>
<div class="line"><a name="l00641"></a><span class="lineno">  641</span>&#160;        <span class="keywordflow">else</span>         myCenter[2] -= myWidth/2;</div>
<div class="line"><a name="l00642"></a><span class="lineno">  642</span>&#160;      }</div>
<div class="line"><a name="l00643"></a><span class="lineno">  643</span>&#160;      width = 1.0 / ( 1&lt;&lt;temp-&gt;depth() );</div>
<div class="line"><a name="l00644"></a><span class="lineno">  644</span>&#160;      n = normal * alpha / Real( pow( width , 3 ) ) * Real( dx );</div>
<div class="line"><a name="l00645"></a><span class="lineno">  645</span>&#160;      NonLinearSplatOrientedPoint( temp , position , n );</div>
<div class="line"><a name="l00646"></a><span class="lineno">  646</span>&#160;      <span class="keywordflow">if</span>( fabs(1.0-dx) &gt; EPSILON )</div>
<div class="line"><a name="l00647"></a><span class="lineno">  647</span>&#160;      {</div>
<div class="line"><a name="l00648"></a><span class="lineno">  648</span>&#160;        dx = Real(1.0-dx);</div>
<div class="line"><a name="l00649"></a><span class="lineno">  649</span>&#160;        temp = temp-&gt;parent;</div>
<div class="line"><a name="l00650"></a><span class="lineno">  650</span>&#160;        width = 1.0 / ( 1&lt;&lt;temp-&gt;depth() );</div>
<div class="line"><a name="l00651"></a><span class="lineno">  651</span>&#160; </div>
<div class="line"><a name="l00652"></a><span class="lineno">  652</span>&#160;        n = normal * alpha / Real( pow( width , 3 ) ) * Real( dx );</div>
<div class="line"><a name="l00653"></a><span class="lineno">  653</span>&#160;        NonLinearSplatOrientedPoint( temp , position , n );</div>
<div class="line"><a name="l00654"></a><span class="lineno">  654</span>&#160;      }</div>
<div class="line"><a name="l00655"></a><span class="lineno">  655</span>&#160;      <span class="keywordflow">return</span> alpha;</div>
<div class="line"><a name="l00656"></a><span class="lineno">  656</span>&#160;    }</div>
<div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l00658"></a><span class="lineno">  658</span>&#160;    <span class="keywordtype">void</span> Octree&lt;Degree&gt;::NonLinearGetSampleDepthAndWeight(TreeOctNode* node,<span class="keyword">const</span> <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;Real&gt;</a>&amp; position,Real samplesPerNode,Real&amp; depth,Real&amp; weight){</div>
<div class="line"><a name="l00659"></a><span class="lineno">  659</span>&#160;      TreeOctNode* temp=node;</div>
<div class="line"><a name="l00660"></a><span class="lineno">  660</span>&#160;      weight = Real(1.0)/NonLinearGetSampleWeight(temp,position);</div>
<div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160;      <span class="keywordflow">if</span>( weight&gt;=samplesPerNode ) depth=Real( temp-&gt;depth() + log( weight / samplesPerNode ) / log(<span class="keywordtype">double</span>(1&lt;&lt;(DIMENSION-1))) );</div>
<div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160;      <span class="keywordflow">else</span></div>
<div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;      {</div>
<div class="line"><a name="l00664"></a><span class="lineno">  664</span>&#160;        Real oldAlpha,newAlpha;</div>
<div class="line"><a name="l00665"></a><span class="lineno">  665</span>&#160;        oldAlpha=newAlpha=weight;</div>
<div class="line"><a name="l00666"></a><span class="lineno">  666</span>&#160;        <span class="keywordflow">while</span>( newAlpha&lt;samplesPerNode &amp;&amp; temp-&gt;parent )</div>
<div class="line"><a name="l00667"></a><span class="lineno">  667</span>&#160;        {</div>
<div class="line"><a name="l00668"></a><span class="lineno">  668</span>&#160;          temp=temp-&gt;parent;</div>
<div class="line"><a name="l00669"></a><span class="lineno">  669</span>&#160;          oldAlpha=newAlpha;</div>
<div class="line"><a name="l00670"></a><span class="lineno">  670</span>&#160;          newAlpha=Real(1.0)/NonLinearGetSampleWeight(temp,position);</div>
<div class="line"><a name="l00671"></a><span class="lineno">  671</span>&#160;        }</div>
<div class="line"><a name="l00672"></a><span class="lineno">  672</span>&#160;        depth = Real( temp-&gt;depth() + log( newAlpha / samplesPerNode ) / log( newAlpha / oldAlpha ) );</div>
<div class="line"><a name="l00673"></a><span class="lineno">  673</span>&#160;      }</div>
<div class="line"><a name="l00674"></a><span class="lineno">  674</span>&#160;      weight=Real(pow(<span class="keywordtype">double</span>(1&lt;&lt;(DIMENSION-1)),-<span class="keywordtype">double</span>(depth)));</div>
<div class="line"><a name="l00675"></a><span class="lineno">  675</span>&#160;    }</div>
<div class="line"><a name="l00676"></a><span class="lineno">  676</span>&#160; </div>
<div class="line"><a name="l00677"></a><span class="lineno">  677</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l00678"></a><span class="lineno">  678</span>&#160;    Real Octree&lt;Degree&gt;::NonLinearGetSampleWeight( TreeOctNode* node , <span class="keyword">const</span> <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;Real&gt;</a>&amp; position )</div>
<div class="line"><a name="l00679"></a><span class="lineno">  679</span>&#160;    {</div>
<div class="line"><a name="l00680"></a><span class="lineno">  680</span>&#160;      Real weight=0;</div>
<div class="line"><a name="l00681"></a><span class="lineno">  681</span>&#160;      <span class="keywordtype">double</span> x,dxdy,dx[DIMENSION][3];</div>
<div class="line"><a name="l00682"></a><span class="lineno">  682</span>&#160;      TreeOctNode::Neighbors3&amp; neighbors=neighborKey.setNeighbors( node );</div>
<div class="line"><a name="l00683"></a><span class="lineno">  683</span>&#160;      <span class="keywordtype">double</span> width;</div>
<div class="line"><a name="l00684"></a><span class="lineno">  684</span>&#160;      <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;Real&gt;</a> center;</div>
<div class="line"><a name="l00685"></a><span class="lineno">  685</span>&#160;      Real w;</div>
<div class="line"><a name="l00686"></a><span class="lineno">  686</span>&#160;      node-&gt;centerAndWidth(center,w);</div>
<div class="line"><a name="l00687"></a><span class="lineno">  687</span>&#160;      width=w;</div>
<div class="line"><a name="l00688"></a><span class="lineno">  688</span>&#160; </div>
<div class="line"><a name="l00689"></a><span class="lineno">  689</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;DIMENSION ; i++ )</div>
<div class="line"><a name="l00690"></a><span class="lineno">  690</span>&#160;      {</div>
<div class="line"><a name="l00691"></a><span class="lineno">  691</span>&#160;        x = ( center[i] - position[i] - width ) / width;</div>
<div class="line"><a name="l00692"></a><span class="lineno">  692</span>&#160;        dx[i][0] = 1.125 + 1.500*x + 0.500*x*x;</div>
<div class="line"><a name="l00693"></a><span class="lineno">  693</span>&#160;        x = ( center[i] - position[i] ) / width;</div>
<div class="line"><a name="l00694"></a><span class="lineno">  694</span>&#160;        dx[i][1] = 0.750           -       x*x;</div>
<div class="line"><a name="l00695"></a><span class="lineno">  695</span>&#160; </div>
<div class="line"><a name="l00696"></a><span class="lineno">  696</span>&#160;        dx[i][2] = 1.0 - dx[i][1] - dx[i][0];</div>
<div class="line"><a name="l00697"></a><span class="lineno">  697</span>&#160;      }</div>
<div class="line"><a name="l00698"></a><span class="lineno">  698</span>&#160; </div>
<div class="line"><a name="l00699"></a><span class="lineno">  699</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;3 ; i++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=0 ; j&lt;3 ; j++ )</div>
<div class="line"><a name="l00700"></a><span class="lineno">  700</span>&#160;      {</div>
<div class="line"><a name="l00701"></a><span class="lineno">  701</span>&#160;        dxdy = dx[0][i] * dx[1][j];</div>
<div class="line"><a name="l00702"></a><span class="lineno">  702</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> k=0 ; k&lt;3 ; k++ ) <span class="keywordflow">if</span>( neighbors.neighbors[i][j][k] )</div>
<div class="line"><a name="l00703"></a><span class="lineno">  703</span>&#160;          weight += Real( dxdy * dx[2][k] * neighbors.neighbors[i][j][k]-&gt;nodeData.centerWeightContribution );</div>
<div class="line"><a name="l00704"></a><span class="lineno">  704</span>&#160;      }</div>
<div class="line"><a name="l00705"></a><span class="lineno">  705</span>&#160;      <span class="keywordflow">return</span> Real( 1.0 / weight );</div>
<div class="line"><a name="l00706"></a><span class="lineno">  706</span>&#160;    }</div>
<div class="line"><a name="l00707"></a><span class="lineno">  707</span>&#160; </div>
<div class="line"><a name="l00708"></a><span class="lineno">  708</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l00709"></a><span class="lineno">  709</span>&#160;    <span class="keywordtype">int</span> Octree&lt;Degree&gt;::NonLinearUpdateWeightContribution( TreeOctNode* node , <span class="keyword">const</span> <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;Real&gt;</a>&amp; position , Real weight )</div>
<div class="line"><a name="l00710"></a><span class="lineno">  710</span>&#160;    {</div>
<div class="line"><a name="l00711"></a><span class="lineno">  711</span>&#160;      TreeOctNode::Neighbors3&amp; neighbors = neighborKey.setNeighbors( node );</div>
<div class="line"><a name="l00712"></a><span class="lineno">  712</span>&#160;      <span class="keywordtype">double</span> x,dxdy,dx[DIMENSION][3];</div>
<div class="line"><a name="l00713"></a><span class="lineno">  713</span>&#160;      <span class="keywordtype">double</span> width;</div>
<div class="line"><a name="l00714"></a><span class="lineno">  714</span>&#160;      <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;Real&gt;</a> center;</div>
<div class="line"><a name="l00715"></a><span class="lineno">  715</span>&#160;      Real w;</div>
<div class="line"><a name="l00716"></a><span class="lineno">  716</span>&#160;      node-&gt;centerAndWidth( center , w );</div>
<div class="line"><a name="l00717"></a><span class="lineno">  717</span>&#160;      width=w;</div>
<div class="line"><a name="l00718"></a><span class="lineno">  718</span>&#160;      <span class="keyword">const</span> <span class="keywordtype">double</span> SAMPLE_SCALE = 1. / ( 0.125 * 0.125 + 0.75 * 0.75 + 0.125 * 0.125 );</div>
<div class="line"><a name="l00719"></a><span class="lineno">  719</span>&#160; </div>
<div class="line"><a name="l00720"></a><span class="lineno">  720</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;DIMENSION ; i++ )</div>
<div class="line"><a name="l00721"></a><span class="lineno">  721</span>&#160;      {</div>
<div class="line"><a name="l00722"></a><span class="lineno">  722</span>&#160;        x = ( center[i] - position[i] - width ) / width;</div>
<div class="line"><a name="l00723"></a><span class="lineno">  723</span>&#160;        dx[i][0] = 1.125 + 1.500*x + 0.500*x*x;</div>
<div class="line"><a name="l00724"></a><span class="lineno">  724</span>&#160;        x = ( center[i] - position[i] ) / width;</div>
<div class="line"><a name="l00725"></a><span class="lineno">  725</span>&#160;        dx[i][1] = 0.750           -       x*x;</div>
<div class="line"><a name="l00726"></a><span class="lineno">  726</span>&#160;        dx[i][2] = 1. - dx[i][1] - dx[i][0];</div>
<div class="line"><a name="l00727"></a><span class="lineno">  727</span>&#160;        <span class="comment">// Note that we are splatting along a co-dimension one manifold, so uniform point samples</span></div>
<div class="line"><a name="l00728"></a><span class="lineno">  728</span>&#160;        <span class="comment">// do not generate a unit sample weight.</span></div>
<div class="line"><a name="l00729"></a><span class="lineno">  729</span>&#160;        dx[i][0] *= SAMPLE_SCALE;</div>
<div class="line"><a name="l00730"></a><span class="lineno">  730</span>&#160;      }</div>
<div class="line"><a name="l00731"></a><span class="lineno">  731</span>&#160; </div>
<div class="line"><a name="l00732"></a><span class="lineno">  732</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;3 ; i++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=0 ; j&lt;3 ; j++ )</div>
<div class="line"><a name="l00733"></a><span class="lineno">  733</span>&#160;      {</div>
<div class="line"><a name="l00734"></a><span class="lineno">  734</span>&#160;        dxdy = dx[0][i] * dx[1][j] * weight;</div>
<div class="line"><a name="l00735"></a><span class="lineno">  735</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> k=0 ; k&lt;3 ; k++ ) <span class="keywordflow">if</span>( neighbors.neighbors[i][j][k] )</div>
<div class="line"><a name="l00736"></a><span class="lineno">  736</span>&#160;          neighbors.neighbors[i][j][k]-&gt;nodeData.centerWeightContribution += Real( dxdy * dx[2][k] );</div>
<div class="line"><a name="l00737"></a><span class="lineno">  737</span>&#160;      }</div>
<div class="line"><a name="l00738"></a><span class="lineno">  738</span>&#160;      <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00739"></a><span class="lineno">  739</span>&#160;    }</div>
<div class="line"><a name="l00740"></a><span class="lineno">  740</span>&#160; </div>
<div class="line"><a name="l00741"></a><span class="lineno">  741</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt; <span class="keyword">template</span>&lt;<span class="keyword">typename</span> Po<span class="keywordtype">int</span>NT&gt; <span class="keywordtype">int</span></div>
<div class="line"><a name="l00742"></a><span class="lineno">  742</span>&#160;    Octree&lt;Degree&gt;::setTree( boost::shared_ptr&lt;<span class="keyword">const</span> <a class="code" href="classpcl_1_1_point_cloud.html">pcl::PointCloud&lt;PointNT&gt;</a> &gt; input_, <span class="keywordtype">int</span> maxDepth , <span class="keywordtype">int</span> minDepth ,</div>
<div class="line"><a name="l00743"></a><span class="lineno">  743</span>&#160;                             <span class="keywordtype">int</span> kernelDepth , Real samplesPerNode , Real scaleFactor , <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;Real&gt;</a>&amp; center , Real&amp; scale ,</div>
<div class="line"><a name="l00744"></a><span class="lineno">  744</span>&#160;                             <span class="keywordtype">int</span> useConfidence , Real constraintWeight , <span class="keywordtype">bool</span> adaptiveWeights )</div>
<div class="line"><a name="l00745"></a><span class="lineno">  745</span>&#160;    {</div>
<div class="line"><a name="l00746"></a><span class="lineno">  746</span>&#160;      _minDepth = std::min&lt; int &gt;( std::max&lt; int &gt;( 0 , minDepth ) , maxDepth );</div>
<div class="line"><a name="l00747"></a><span class="lineno">  747</span>&#160;      _constrainValues = (constraintWeight&gt;0);</div>
<div class="line"><a name="l00748"></a><span class="lineno">  748</span>&#160;      <span class="keywordtype">double</span> pointWeightSum = 0;</div>
<div class="line"><a name="l00749"></a><span class="lineno">  749</span>&#160;      <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;Real&gt;</a> min , max , position , normal , myCenter;</div>
<div class="line"><a name="l00750"></a><span class="lineno">  750</span>&#160;      Real myWidth;</div>
<div class="line"><a name="l00751"></a><span class="lineno">  751</span>&#160;      <span class="keywordtype">int</span> i , cnt=0;</div>
<div class="line"><a name="l00752"></a><span class="lineno">  752</span>&#160;      TreeOctNode* temp;</div>
<div class="line"><a name="l00753"></a><span class="lineno">  753</span>&#160;      <span class="keywordtype">int</span> splatDepth=0;</div>
<div class="line"><a name="l00754"></a><span class="lineno">  754</span>&#160; </div>
<div class="line"><a name="l00755"></a><span class="lineno">  755</span>&#160;      TreeNodeData::UseIndex = 1;</div>
<div class="line"><a name="l00756"></a><span class="lineno">  756</span>&#160;      neighborKey.set( maxDepth );</div>
<div class="line"><a name="l00757"></a><span class="lineno">  757</span>&#160;      splatDepth = kernelDepth;</div>
<div class="line"><a name="l00758"></a><span class="lineno">  758</span>&#160;      <span class="keywordflow">if</span>( splatDepth&lt;0 ) splatDepth = 0;</div>
<div class="line"><a name="l00759"></a><span class="lineno">  759</span>&#160; </div>
<div class="line"><a name="l00760"></a><span class="lineno">  760</span>&#160; </div>
<div class="line"><a name="l00761"></a><span class="lineno">  761</span>&#160;      tree.setFullDepth( _minDepth );</div>
<div class="line"><a name="l00762"></a><span class="lineno">  762</span>&#160;      <span class="comment">// Read through once to get the center and scale</span></div>
<div class="line"><a name="l00763"></a><span class="lineno">  763</span>&#160;      <span class="keywordflow">while</span> (cnt != input_-&gt;size ())</div>
<div class="line"><a name="l00764"></a><span class="lineno">  764</span>&#160;      {</div>
<div class="line"><a name="l00765"></a><span class="lineno">  765</span>&#160;        <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> p;</div>
<div class="line"><a name="l00766"></a><span class="lineno">  766</span>&#160;        p[0] = input_-&gt;points[cnt].x;</div>
<div class="line"><a name="l00767"></a><span class="lineno">  767</span>&#160;        p[1] = input_-&gt;points[cnt].y;</div>
<div class="line"><a name="l00768"></a><span class="lineno">  768</span>&#160;        p[2] = input_-&gt;points[cnt].z;</div>
<div class="line"><a name="l00769"></a><span class="lineno">  769</span>&#160; </div>
<div class="line"><a name="l00770"></a><span class="lineno">  770</span>&#160;        <span class="keywordflow">for</span> (i = 0; i &lt; DIMENSION; i++)</div>
<div class="line"><a name="l00771"></a><span class="lineno">  771</span>&#160;        {</div>
<div class="line"><a name="l00772"></a><span class="lineno">  772</span>&#160;          <span class="keywordflow">if</span>( !cnt || p[i]&lt;min[i] ) min[i] = p[i];</div>
<div class="line"><a name="l00773"></a><span class="lineno">  773</span>&#160;          <span class="keywordflow">if</span>( !cnt || p[i]&gt;max[i] ) max[i] = p[i];</div>
<div class="line"><a name="l00774"></a><span class="lineno">  774</span>&#160;        }</div>
<div class="line"><a name="l00775"></a><span class="lineno">  775</span>&#160;        cnt++;</div>
<div class="line"><a name="l00776"></a><span class="lineno">  776</span>&#160;      }</div>
<div class="line"><a name="l00777"></a><span class="lineno">  777</span>&#160; </div>
<div class="line"><a name="l00778"></a><span class="lineno">  778</span>&#160;      scale = std::max&lt; Real &gt;( max[0]-min[0] , std::max&lt; Real &gt;( max[1]-min[1] , max[2]-min[2] ) );</div>
<div class="line"><a name="l00779"></a><span class="lineno">  779</span>&#160;      center = ( max+min ) /2;</div>
<div class="line"><a name="l00780"></a><span class="lineno">  780</span>&#160; </div>
<div class="line"><a name="l00781"></a><span class="lineno">  781</span>&#160;      scale *= scaleFactor;</div>
<div class="line"><a name="l00782"></a><span class="lineno">  782</span>&#160;      <span class="keywordflow">for</span>( i=0 ; i&lt;DIMENSION ; i++ ) center[i] -= scale/2;</div>
<div class="line"><a name="l00783"></a><span class="lineno">  783</span>&#160;      <span class="keywordflow">if</span>( splatDepth&gt;0 )</div>
<div class="line"><a name="l00784"></a><span class="lineno">  784</span>&#160;      {</div>
<div class="line"><a name="l00785"></a><span class="lineno">  785</span>&#160;        cnt = 0;</div>
<div class="line"><a name="l00786"></a><span class="lineno">  786</span>&#160;        <span class="keywordflow">while</span> (cnt != input_-&gt;size ())</div>
<div class="line"><a name="l00787"></a><span class="lineno">  787</span>&#160;        {</div>
<div class="line"><a name="l00788"></a><span class="lineno">  788</span>&#160;          position[0] = input_-&gt;points[cnt].x;</div>
<div class="line"><a name="l00789"></a><span class="lineno">  789</span>&#160;          position[1] = input_-&gt;points[cnt].y;</div>
<div class="line"><a name="l00790"></a><span class="lineno">  790</span>&#160;          position[2] = input_-&gt;points[cnt].z;</div>
<div class="line"><a name="l00791"></a><span class="lineno">  791</span>&#160;          normal[0] = input_-&gt;points[cnt].normal_x;</div>
<div class="line"><a name="l00792"></a><span class="lineno">  792</span>&#160;          normal[1] = input_-&gt;points[cnt].normal_y;</div>
<div class="line"><a name="l00793"></a><span class="lineno">  793</span>&#160;          normal[2] = input_-&gt;points[cnt].normal_z;</div>
<div class="line"><a name="l00794"></a><span class="lineno">  794</span>&#160; </div>
<div class="line"><a name="l00795"></a><span class="lineno">  795</span>&#160;          <span class="keywordflow">for</span>( i=0 ; i&lt;DIMENSION ; i++ ) position[i] = ( position[i]-center[i] ) / scale;</div>
<div class="line"><a name="l00796"></a><span class="lineno">  796</span>&#160;          myCenter[0] = myCenter[1] = myCenter[2] = Real(0.5);</div>
<div class="line"><a name="l00797"></a><span class="lineno">  797</span>&#160;          myWidth = Real(1.0);</div>
<div class="line"><a name="l00798"></a><span class="lineno">  798</span>&#160;          <span class="keywordflow">for</span>( i=0 ; i&lt;DIMENSION ; i++ ) <span class="keywordflow">if</span>( position[i]&lt;myCenter[i]-myWidth/2 || position[i]&gt;myCenter[i]+myWidth/2 ) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00799"></a><span class="lineno">  799</span>&#160;          <span class="keywordflow">if</span>( i!=DIMENSION ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00800"></a><span class="lineno">  800</span>&#160;          Real weight=Real( 1. );</div>
<div class="line"><a name="l00801"></a><span class="lineno">  801</span>&#160;          <span class="keywordflow">if</span>( useConfidence ) weight = Real( Length(normal) );</div>
<div class="line"><a name="l00802"></a><span class="lineno">  802</span>&#160;          temp = &amp;tree;</div>
<div class="line"><a name="l00803"></a><span class="lineno">  803</span>&#160;          <span class="keywordtype">int</span> d=0;</div>
<div class="line"><a name="l00804"></a><span class="lineno">  804</span>&#160;          <span class="keywordflow">while</span>( d&lt;splatDepth )</div>
<div class="line"><a name="l00805"></a><span class="lineno">  805</span>&#160;          {</div>
<div class="line"><a name="l00806"></a><span class="lineno">  806</span>&#160;            NonLinearUpdateWeightContribution( temp , position , weight );</div>
<div class="line"><a name="l00807"></a><span class="lineno">  807</span>&#160;            <span class="keywordflow">if</span>( !temp-&gt;children ) temp-&gt;initChildren();</div>
<div class="line"><a name="l00808"></a><span class="lineno">  808</span>&#160;            <span class="keywordtype">int</span> cIndex=TreeOctNode::CornerIndex(myCenter,position);</div>
<div class="line"><a name="l00809"></a><span class="lineno">  809</span>&#160;            temp=&amp;temp-&gt;children[cIndex];</div>
<div class="line"><a name="l00810"></a><span class="lineno">  810</span>&#160;            myWidth/=2;</div>
<div class="line"><a name="l00811"></a><span class="lineno">  811</span>&#160;            <span class="keywordflow">if</span>(cIndex&amp;1) myCenter[0] += myWidth/2;</div>
<div class="line"><a name="l00812"></a><span class="lineno">  812</span>&#160;            <span class="keywordflow">else</span>         myCenter[0] -= myWidth/2;</div>
<div class="line"><a name="l00813"></a><span class="lineno">  813</span>&#160;            <span class="keywordflow">if</span>(cIndex&amp;2) myCenter[1] += myWidth/2;</div>
<div class="line"><a name="l00814"></a><span class="lineno">  814</span>&#160;            <span class="keywordflow">else</span>         myCenter[1] -= myWidth/2;</div>
<div class="line"><a name="l00815"></a><span class="lineno">  815</span>&#160;            <span class="keywordflow">if</span>(cIndex&amp;4) myCenter[2] += myWidth/2;</div>
<div class="line"><a name="l00816"></a><span class="lineno">  816</span>&#160;            <span class="keywordflow">else</span>         myCenter[2] -= myWidth/2;</div>
<div class="line"><a name="l00817"></a><span class="lineno">  817</span>&#160;            d++;</div>
<div class="line"><a name="l00818"></a><span class="lineno">  818</span>&#160;          }</div>
<div class="line"><a name="l00819"></a><span class="lineno">  819</span>&#160;          NonLinearUpdateWeightContribution( temp , position , weight );</div>
<div class="line"><a name="l00820"></a><span class="lineno">  820</span>&#160;          cnt++;</div>
<div class="line"><a name="l00821"></a><span class="lineno">  821</span>&#160;        }</div>
<div class="line"><a name="l00822"></a><span class="lineno">  822</span>&#160;      }</div>
<div class="line"><a name="l00823"></a><span class="lineno">  823</span>&#160; </div>
<div class="line"><a name="l00824"></a><span class="lineno">  824</span>&#160;      normals = <span class="keyword">new</span> std::vector&lt; Point3D&lt;Real&gt; &gt;();</div>
<div class="line"><a name="l00825"></a><span class="lineno">  825</span>&#160;      cnt=0;</div>
<div class="line"><a name="l00826"></a><span class="lineno">  826</span>&#160;      <span class="keywordflow">while</span> (cnt != input_-&gt;size ())</div>
<div class="line"><a name="l00827"></a><span class="lineno">  827</span>&#160;      {</div>
<div class="line"><a name="l00828"></a><span class="lineno">  828</span>&#160;        position[0] = input_-&gt;points[cnt].x;</div>
<div class="line"><a name="l00829"></a><span class="lineno">  829</span>&#160;        position[1] = input_-&gt;points[cnt].y;</div>
<div class="line"><a name="l00830"></a><span class="lineno">  830</span>&#160;        position[2] = input_-&gt;points[cnt].z;</div>
<div class="line"><a name="l00831"></a><span class="lineno">  831</span>&#160;        normal[0] = input_-&gt;points[cnt].normal_x;</div>
<div class="line"><a name="l00832"></a><span class="lineno">  832</span>&#160;        normal[1] = input_-&gt;points[cnt].normal_y;</div>
<div class="line"><a name="l00833"></a><span class="lineno">  833</span>&#160;        normal[2] = input_-&gt;points[cnt].normal_z;</div>
<div class="line"><a name="l00834"></a><span class="lineno">  834</span>&#160;        cnt ++;</div>
<div class="line"><a name="l00835"></a><span class="lineno">  835</span>&#160;        <span class="keywordflow">for</span>( i=0 ; i&lt;DIMENSION ; i++ ) position[i] = ( position[i]-center[i] ) / scale;</div>
<div class="line"><a name="l00836"></a><span class="lineno">  836</span>&#160;        myCenter[0] = myCenter[1] = myCenter[2] = Real(0.5);</div>
<div class="line"><a name="l00837"></a><span class="lineno">  837</span>&#160;        myWidth = Real(1.0);</div>
<div class="line"><a name="l00838"></a><span class="lineno">  838</span>&#160;        <span class="keywordflow">for</span>( i=0 ; i&lt;DIMENSION ; i++ ) <span class="keywordflow">if</span>(position[i]&lt;myCenter[i]-myWidth/2 || position[i]&gt;myCenter[i]+myWidth/2) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00839"></a><span class="lineno">  839</span>&#160;        <span class="keywordflow">if</span>( i!=DIMENSION ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00840"></a><span class="lineno">  840</span>&#160;        Real l = Real( Length( normal ) );</div>
<div class="line"><a name="l00841"></a><span class="lineno">  841</span>&#160;        <span class="keywordflow">if</span>( l!=l || l&lt;=EPSILON ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00842"></a><span class="lineno">  842</span>&#160;        <span class="keywordflow">if</span>( !useConfidence ) normal /= l;</div>
<div class="line"><a name="l00843"></a><span class="lineno">  843</span>&#160; </div>
<div class="line"><a name="l00844"></a><span class="lineno">  844</span>&#160;        l = Real(1.);</div>
<div class="line"><a name="l00845"></a><span class="lineno">  845</span>&#160;        Real pointWeight = Real(1.f);</div>
<div class="line"><a name="l00846"></a><span class="lineno">  846</span>&#160;        <span class="keywordflow">if</span>( samplesPerNode&gt;0 &amp;&amp; splatDepth )</div>
<div class="line"><a name="l00847"></a><span class="lineno">  847</span>&#160;        {</div>
<div class="line"><a name="l00848"></a><span class="lineno">  848</span>&#160;          pointWeight = NonLinearSplatOrientedPoint( position , normal , splatDepth , samplesPerNode , _minDepth , maxDepth );</div>
<div class="line"><a name="l00849"></a><span class="lineno">  849</span>&#160;        }</div>
<div class="line"><a name="l00850"></a><span class="lineno">  850</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l00851"></a><span class="lineno">  851</span>&#160;        {</div>
<div class="line"><a name="l00852"></a><span class="lineno">  852</span>&#160;          Real alpha=1;</div>
<div class="line"><a name="l00853"></a><span class="lineno">  853</span>&#160;          temp = &amp;tree;</div>
<div class="line"><a name="l00854"></a><span class="lineno">  854</span>&#160;          <span class="keywordtype">int</span> d=0;</div>
<div class="line"><a name="l00855"></a><span class="lineno">  855</span>&#160;          <span class="keywordflow">if</span>( splatDepth )</div>
<div class="line"><a name="l00856"></a><span class="lineno">  856</span>&#160;          {</div>
<div class="line"><a name="l00857"></a><span class="lineno">  857</span>&#160;            <span class="keywordflow">while</span>( d&lt;splatDepth )</div>
<div class="line"><a name="l00858"></a><span class="lineno">  858</span>&#160;            {</div>
<div class="line"><a name="l00859"></a><span class="lineno">  859</span>&#160;              <span class="keywordtype">int</span> cIndex=TreeOctNode::CornerIndex(myCenter,position);</div>
<div class="line"><a name="l00860"></a><span class="lineno">  860</span>&#160;              temp=&amp;temp-&gt;children[cIndex];</div>
<div class="line"><a name="l00861"></a><span class="lineno">  861</span>&#160;              myWidth/=2;</div>
<div class="line"><a name="l00862"></a><span class="lineno">  862</span>&#160;              <span class="keywordflow">if</span>(cIndex&amp;1) myCenter[0]+=myWidth/2;</div>
<div class="line"><a name="l00863"></a><span class="lineno">  863</span>&#160;              <span class="keywordflow">else</span>       myCenter[0]-=myWidth/2;</div>
<div class="line"><a name="l00864"></a><span class="lineno">  864</span>&#160;              <span class="keywordflow">if</span>(cIndex&amp;2) myCenter[1]+=myWidth/2;</div>
<div class="line"><a name="l00865"></a><span class="lineno">  865</span>&#160;              <span class="keywordflow">else</span>       myCenter[1]-=myWidth/2;</div>
<div class="line"><a name="l00866"></a><span class="lineno">  866</span>&#160;              <span class="keywordflow">if</span>(cIndex&amp;4) myCenter[2]+=myWidth/2;</div>
<div class="line"><a name="l00867"></a><span class="lineno">  867</span>&#160;              <span class="keywordflow">else</span>       myCenter[2]-=myWidth/2;</div>
<div class="line"><a name="l00868"></a><span class="lineno">  868</span>&#160;              d++;</div>
<div class="line"><a name="l00869"></a><span class="lineno">  869</span>&#160;            }</div>
<div class="line"><a name="l00870"></a><span class="lineno">  870</span>&#160;            alpha = NonLinearGetSampleWeight( temp , position );</div>
<div class="line"><a name="l00871"></a><span class="lineno">  871</span>&#160;          }</div>
<div class="line"><a name="l00872"></a><span class="lineno">  872</span>&#160;          <span class="keywordflow">for</span>( i=0 ; i&lt;DIMENSION ; i++ ) normal[i]*=alpha;</div>
<div class="line"><a name="l00873"></a><span class="lineno">  873</span>&#160;          <span class="keywordflow">while</span>( d&lt;maxDepth )</div>
<div class="line"><a name="l00874"></a><span class="lineno">  874</span>&#160;          {</div>
<div class="line"><a name="l00875"></a><span class="lineno">  875</span>&#160;            <span class="keywordflow">if</span>(!temp-&gt;children){temp-&gt;initChildren();}</div>
<div class="line"><a name="l00876"></a><span class="lineno">  876</span>&#160;            <span class="keywordtype">int</span> cIndex=TreeOctNode::CornerIndex(myCenter,position);</div>
<div class="line"><a name="l00877"></a><span class="lineno">  877</span>&#160;            temp=&amp;temp-&gt;children[cIndex];</div>
<div class="line"><a name="l00878"></a><span class="lineno">  878</span>&#160;            myWidth/=2;</div>
<div class="line"><a name="l00879"></a><span class="lineno">  879</span>&#160;            <span class="keywordflow">if</span>(cIndex&amp;1) myCenter[0]+=myWidth/2;</div>
<div class="line"><a name="l00880"></a><span class="lineno">  880</span>&#160;            <span class="keywordflow">else</span>         myCenter[0]-=myWidth/2;</div>
<div class="line"><a name="l00881"></a><span class="lineno">  881</span>&#160;            <span class="keywordflow">if</span>(cIndex&amp;2) myCenter[1]+=myWidth/2;</div>
<div class="line"><a name="l00882"></a><span class="lineno">  882</span>&#160;            <span class="keywordflow">else</span>         myCenter[1]-=myWidth/2;</div>
<div class="line"><a name="l00883"></a><span class="lineno">  883</span>&#160;            <span class="keywordflow">if</span>(cIndex&amp;4) myCenter[2]+=myWidth/2;</div>
<div class="line"><a name="l00884"></a><span class="lineno">  884</span>&#160;            <span class="keywordflow">else</span>         myCenter[2]-=myWidth/2;</div>
<div class="line"><a name="l00885"></a><span class="lineno">  885</span>&#160;            d++;</div>
<div class="line"><a name="l00886"></a><span class="lineno">  886</span>&#160;          }</div>
<div class="line"><a name="l00887"></a><span class="lineno">  887</span>&#160;          NonLinearSplatOrientedPoint( temp , position , normal );</div>
<div class="line"><a name="l00888"></a><span class="lineno">  888</span>&#160;          pointWeight = alpha;</div>
<div class="line"><a name="l00889"></a><span class="lineno">  889</span>&#160;        }</div>
<div class="line"><a name="l00890"></a><span class="lineno">  890</span>&#160;        pointWeight = 1;</div>
<div class="line"><a name="l00891"></a><span class="lineno">  891</span>&#160;        pointWeightSum += pointWeight;</div>
<div class="line"><a name="l00892"></a><span class="lineno">  892</span>&#160;        <span class="keywordflow">if</span>( _constrainValues )</div>
<div class="line"><a name="l00893"></a><span class="lineno">  893</span>&#160;        {</div>
<div class="line"><a name="l00894"></a><span class="lineno">  894</span>&#160;          <span class="keywordtype">int</span> d = 0;</div>
<div class="line"><a name="l00895"></a><span class="lineno">  895</span>&#160;          TreeOctNode* temp = &amp;tree;</div>
<div class="line"><a name="l00896"></a><span class="lineno">  896</span>&#160;          myCenter[0] = myCenter[1] = myCenter[2] = Real(0.5);</div>
<div class="line"><a name="l00897"></a><span class="lineno">  897</span>&#160;          myWidth = Real(1.0);</div>
<div class="line"><a name="l00898"></a><span class="lineno">  898</span>&#160;          <span class="keywordflow">while</span>( 1 )</div>
<div class="line"><a name="l00899"></a><span class="lineno">  899</span>&#160;          {</div>
<div class="line"><a name="l00900"></a><span class="lineno">  900</span>&#160;            <span class="keywordtype">int</span> idx = temp-&gt;nodeData.pointIndex;</div>
<div class="line"><a name="l00901"></a><span class="lineno">  901</span>&#160;            <span class="keywordflow">if</span>( idx==-1 )</div>
<div class="line"><a name="l00902"></a><span class="lineno">  902</span>&#160;            {</div>
<div class="line"><a name="l00903"></a><span class="lineno">  903</span>&#160;              <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> p;</div>
<div class="line"><a name="l00904"></a><span class="lineno">  904</span>&#160;              p[0] = p[1] = p[2] = 0;</div>
<div class="line"><a name="l00905"></a><span class="lineno">  905</span>&#160;              idx = int( _points.size() );</div>
<div class="line"><a name="l00906"></a><span class="lineno">  906</span>&#160;              _points.push_back( PointData( position*pointWeight , pointWeight ) );</div>
<div class="line"><a name="l00907"></a><span class="lineno">  907</span>&#160;              temp-&gt;nodeData.pointIndex = idx;</div>
<div class="line"><a name="l00908"></a><span class="lineno">  908</span>&#160;            }</div>
<div class="line"><a name="l00909"></a><span class="lineno">  909</span>&#160;            <span class="keywordflow">else</span></div>
<div class="line"><a name="l00910"></a><span class="lineno">  910</span>&#160;            {</div>
<div class="line"><a name="l00911"></a><span class="lineno">  911</span>&#160;              _points[idx].weight += pointWeight;</div>
<div class="line"><a name="l00912"></a><span class="lineno">  912</span>&#160;              _points[idx].position += position * pointWeight;</div>
<div class="line"><a name="l00913"></a><span class="lineno">  913</span>&#160;            }</div>
<div class="line"><a name="l00914"></a><span class="lineno">  914</span>&#160; </div>
<div class="line"><a name="l00915"></a><span class="lineno">  915</span>&#160;            <span class="keywordtype">int</span> cIndex = TreeOctNode::CornerIndex( myCenter , position );</div>
<div class="line"><a name="l00916"></a><span class="lineno">  916</span>&#160;            <span class="keywordflow">if</span>( !temp-&gt;children ) <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00917"></a><span class="lineno">  917</span>&#160;            temp = &amp;temp-&gt;children[cIndex];</div>
<div class="line"><a name="l00918"></a><span class="lineno">  918</span>&#160;            myWidth /= 2;</div>
<div class="line"><a name="l00919"></a><span class="lineno">  919</span>&#160;            <span class="keywordflow">if</span>( cIndex&amp;1 ) myCenter[0] += myWidth/2;</div>
<div class="line"><a name="l00920"></a><span class="lineno">  920</span>&#160;            <span class="keywordflow">else</span>           myCenter[0] -= myWidth/2;</div>
<div class="line"><a name="l00921"></a><span class="lineno">  921</span>&#160;            <span class="keywordflow">if</span>( cIndex&amp;2 ) myCenter[1] += myWidth/2;</div>
<div class="line"><a name="l00922"></a><span class="lineno">  922</span>&#160;            <span class="keywordflow">else</span>           myCenter[1] -= myWidth/2;</div>
<div class="line"><a name="l00923"></a><span class="lineno">  923</span>&#160;            <span class="keywordflow">if</span>( cIndex&amp;4 ) myCenter[2] += myWidth/2;</div>
<div class="line"><a name="l00924"></a><span class="lineno">  924</span>&#160;            <span class="keywordflow">else</span>           myCenter[2] -= myWidth/2;</div>
<div class="line"><a name="l00925"></a><span class="lineno">  925</span>&#160;            d++;</div>
<div class="line"><a name="l00926"></a><span class="lineno">  926</span>&#160;          }</div>
<div class="line"><a name="l00927"></a><span class="lineno">  927</span>&#160;        }</div>
<div class="line"><a name="l00928"></a><span class="lineno">  928</span>&#160;      }</div>
<div class="line"><a name="l00929"></a><span class="lineno">  929</span>&#160; </div>
<div class="line"><a name="l00930"></a><span class="lineno">  930</span>&#160; </div>
<div class="line"><a name="l00931"></a><span class="lineno">  931</span>&#160;      <span class="keywordflow">if</span>( _constrainValues )</div>
<div class="line"><a name="l00932"></a><span class="lineno">  932</span>&#160;        <span class="keywordflow">for</span>( TreeOctNode* n=tree.nextNode() ; n ; n=tree.nextNode(n) )</div>
<div class="line"><a name="l00933"></a><span class="lineno">  933</span>&#160;          <span class="keywordflow">if</span>( n-&gt;nodeData.pointIndex!=-1 )</div>
<div class="line"><a name="l00934"></a><span class="lineno">  934</span>&#160;          {</div>
<div class="line"><a name="l00935"></a><span class="lineno">  935</span>&#160;            <span class="keywordtype">int</span> idx = n-&gt;nodeData.pointIndex;</div>
<div class="line"><a name="l00936"></a><span class="lineno">  936</span>&#160;            _points[idx].position /= _points[idx].weight;</div>
<div class="line"><a name="l00937"></a><span class="lineno">  937</span>&#160;            <span class="keywordflow">if</span>( adaptiveWeights ) _points[idx].weight *= (1&lt;&lt;n-&gt;d);</div>
<div class="line"><a name="l00938"></a><span class="lineno">  938</span>&#160;            <span class="keywordflow">else</span>                  _points[idx].weight *= (1&lt;&lt;maxDepth);</div>
<div class="line"><a name="l00939"></a><span class="lineno">  939</span>&#160;            _points[idx].weight *= Real( constraintWeight / pointWeightSum );</div>
<div class="line"><a name="l00940"></a><span class="lineno">  940</span>&#160;          }</div>
<div class="line"><a name="l00941"></a><span class="lineno">  941</span>&#160;<span class="preprocessor">#if FORCE_NEUMANN_FIELD</span></div>
<div class="line"><a name="l00942"></a><span class="lineno">  942</span>&#160;      <span class="keywordflow">for</span>( TreeOctNode* node=tree.nextNode() ; node ; node=tree.nextNode( node ) )</div>
<div class="line"><a name="l00943"></a><span class="lineno">  943</span>&#160;      {</div>
<div class="line"><a name="l00944"></a><span class="lineno">  944</span>&#160;        <span class="keywordtype">int</span> d , off[3] , res;</div>
<div class="line"><a name="l00945"></a><span class="lineno">  945</span>&#160;        node-&gt;depthAndOffset( d , off );</div>
<div class="line"><a name="l00946"></a><span class="lineno">  946</span>&#160;        res = 1&lt;&lt;d;</div>
<div class="line"><a name="l00947"></a><span class="lineno">  947</span>&#160;        <span class="keywordflow">if</span>( node-&gt;nodeData.normalIndex&lt;0 ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00948"></a><span class="lineno">  948</span>&#160;        <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a>&amp; normal = (*normals)[node-&gt;nodeData.normalIndex];</div>
<div class="line"><a name="l00949"></a><span class="lineno">  949</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=0 ; d&lt;3 ; d++ ) <span class="keywordflow">if</span>( off[d]==0 || off[d]==res-1 ) normal[d] = 0;</div>
<div class="line"><a name="l00950"></a><span class="lineno">  950</span>&#160;      }</div>
<div class="line"><a name="l00951"></a><span class="lineno">  951</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// FORCE_NEUMANN_FIELD</span></div>
<div class="line"><a name="l00952"></a><span class="lineno">  952</span>&#160;      _sNodes.set( tree );</div>
<div class="line"><a name="l00953"></a><span class="lineno">  953</span>&#160; </div>
<div class="line"><a name="l00954"></a><span class="lineno">  954</span>&#160; </div>
<div class="line"><a name="l00955"></a><span class="lineno">  955</span>&#160;      <span class="keywordflow">return</span> cnt;</div>
<div class="line"><a name="l00956"></a><span class="lineno">  956</span>&#160;    }</div>
<div class="line"><a name="l00957"></a><span class="lineno">  957</span>&#160; </div>
<div class="line"><a name="l00958"></a><span class="lineno">  958</span>&#160; </div>
<div class="line"><a name="l00959"></a><span class="lineno">  959</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l00960"></a><span class="lineno">  960</span>&#160;    <span class="keywordtype">void</span> Octree&lt;Degree&gt;::setBSplineData( <span class="keywordtype">int</span> maxDepth , Real normalSmooth , <span class="keywordtype">bool</span> reflectBoundary )</div>
<div class="line"><a name="l00961"></a><span class="lineno">  961</span>&#160;    {</div>
<div class="line"><a name="l00962"></a><span class="lineno">  962</span>&#160;      radius = 0.5 + 0.5 * Degree;</div>
<div class="line"><a name="l00963"></a><span class="lineno">  963</span>&#160;      width=int(<span class="keywordtype">double</span>(radius+0.5-EPSILON)*2);</div>
<div class="line"><a name="l00964"></a><span class="lineno">  964</span>&#160;      <span class="keywordflow">if</span>( normalSmooth&gt;0 ) postNormalSmooth = normalSmooth;</div>
<div class="line"><a name="l00965"></a><span class="lineno">  965</span>&#160;      fData.set( maxDepth , <span class="keyword">true</span> , reflectBoundary );</div>
<div class="line"><a name="l00966"></a><span class="lineno">  966</span>&#160;    }</div>
<div class="line"><a name="l00967"></a><span class="lineno">  967</span>&#160; </div>
<div class="line"><a name="l00968"></a><span class="lineno">  968</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l00969"></a><span class="lineno">  969</span>&#160;    <span class="keywordtype">void</span> Octree&lt;Degree&gt;::finalize( <span class="keywordtype">void</span> )</div>
<div class="line"><a name="l00970"></a><span class="lineno">  970</span>&#160;    {</div>
<div class="line"><a name="l00971"></a><span class="lineno">  971</span>&#160;      <span class="keywordtype">int</span> maxDepth = tree.maxDepth( );</div>
<div class="line"><a name="l00972"></a><span class="lineno">  972</span>&#160;      TreeOctNode::NeighborKey5 nKey;</div>
<div class="line"><a name="l00973"></a><span class="lineno">  973</span>&#160;      nKey.set( maxDepth );</div>
<div class="line"><a name="l00974"></a><span class="lineno">  974</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=maxDepth ; d&gt;0 ; d-- )</div>
<div class="line"><a name="l00975"></a><span class="lineno">  975</span>&#160;        <span class="keywordflow">for</span>( TreeOctNode* node=tree.nextNode() ; node ; node=tree.nextNode( node ) )</div>
<div class="line"><a name="l00976"></a><span class="lineno">  976</span>&#160;          <span class="keywordflow">if</span>( node-&gt;d==d )</div>
<div class="line"><a name="l00977"></a><span class="lineno">  977</span>&#160;          {</div>
<div class="line"><a name="l00978"></a><span class="lineno">  978</span>&#160;            <span class="keywordtype">int</span> xStart=0 , xEnd=5 , yStart=0 , yEnd=5 , zStart=0 , zEnd=5;</div>
<div class="line"><a name="l00979"></a><span class="lineno">  979</span>&#160;            <span class="keywordtype">int</span> c = int( node - node-&gt;parent-&gt;children );</div>
<div class="line"><a name="l00980"></a><span class="lineno">  980</span>&#160;            <span class="keywordtype">int</span> x , y , z;</div>
<div class="line"><a name="l00981"></a><span class="lineno">  981</span>&#160;            Cube::FactorCornerIndex( c , x , y , z );</div>
<div class="line"><a name="l00982"></a><span class="lineno">  982</span>&#160;            <span class="keywordflow">if</span>( x ) xStart = 1;</div>
<div class="line"><a name="l00983"></a><span class="lineno">  983</span>&#160;            <span class="keywordflow">else</span>    xEnd   = 4;</div>
<div class="line"><a name="l00984"></a><span class="lineno">  984</span>&#160;            <span class="keywordflow">if</span>( y ) yStart = 1;</div>
<div class="line"><a name="l00985"></a><span class="lineno">  985</span>&#160;            <span class="keywordflow">else</span>    yEnd   = 4;</div>
<div class="line"><a name="l00986"></a><span class="lineno">  986</span>&#160;            <span class="keywordflow">if</span>( z ) zStart = 1;</div>
<div class="line"><a name="l00987"></a><span class="lineno">  987</span>&#160;            <span class="keywordflow">else</span>    zEnd   = 4;</div>
<div class="line"><a name="l00988"></a><span class="lineno">  988</span>&#160;            nKey.setNeighbors( node-&gt;parent , xStart , xEnd , yStart , yEnd , zStart , zEnd );</div>
<div class="line"><a name="l00989"></a><span class="lineno">  989</span>&#160;          }</div>
<div class="line"><a name="l00990"></a><span class="lineno">  990</span>&#160;      _sNodes.set( tree );</div>
<div class="line"><a name="l00991"></a><span class="lineno">  991</span>&#160;      MemoryUsage();</div>
<div class="line"><a name="l00992"></a><span class="lineno">  992</span>&#160;    }</div>
<div class="line"><a name="l00993"></a><span class="lineno">  993</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l00994"></a><span class="lineno">  994</span>&#160;    Real Octree&lt; Degree &gt;::GetValue( <span class="keyword">const</span> PointInfo points[3][3][3] , <span class="keyword">const</span> <span class="keywordtype">bool</span> hasPoints[3][3] , <span class="keyword">const</span> <span class="keywordtype">int</span> d[3] )<span class="keyword"> const</span></div>
<div class="line"><a name="l00995"></a><span class="lineno">  995</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l00996"></a><span class="lineno">  996</span>&#160;      <span class="keywordtype">double</span> v = 0.;</div>
<div class="line"><a name="l00997"></a><span class="lineno">  997</span>&#160;      <span class="keyword">const</span> <span class="keywordtype">int</span> min[] = { std::max&lt;int&gt;( 0 , d[0]+0 ) , std::max&lt;int&gt;( 0 , d[1]+0 ) , std::max&lt;int&gt;( 0 , d[2]+0 ) };</div>
<div class="line"><a name="l00998"></a><span class="lineno">  998</span>&#160;      <span class="keyword">const</span> <span class="keywordtype">int</span> max[] = { std::min&lt;int&gt;( 2 , d[0]+2 ) , std::min&lt;int&gt;( 2 , d[1]+2 ) , std::min&lt;int&gt;( 2 , d[2]+2 ) };</div>
<div class="line"><a name="l00999"></a><span class="lineno">  999</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=min[0] ; i&lt;=max[0] ; i++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=min[1] ; j&lt;=max[1] ; j++ )</div>
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>&#160;      {</div>
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>&#160;        <span class="keywordflow">if</span>( !hasPoints[i][j] ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>&#160;        <span class="keyword">const</span> PointInfo* pInfo = points[i][j];</div>
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>&#160;        <span class="keywordtype">int</span> ii = -d[0]+i;</div>
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>&#160;        <span class="keywordtype">int</span> jj = -d[1]+j;</div>
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> k=min[2] ; k&lt;=max[2] ; k++ )</div>
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>&#160;          <span class="keywordflow">if</span>( pInfo[k].weightedValue )</div>
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>&#160;            v += pInfo[k].splineValues[0][ii] * pInfo[k].splineValues[1][jj] * pInfo[k].splineValues[2][-d[2]+k];</div>
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>&#160;      }</div>
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>&#160;      <span class="keywordflow">return</span> Real( v );</div>
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>&#160;    }</div>
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>&#160;    Real Octree&lt;Degree&gt;::GetLaplacian( <span class="keyword">const</span> <span class="keywordtype">int</span> idx[DIMENSION] )<span class="keyword"> const</span></div>
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>&#160;      <span class="keywordflow">return</span> Real( fData.vvDotTable[idx[0]] * fData.vvDotTable[idx[1]] * fData.vvDotTable[idx[2]] * (fData.ddDotTable[idx[0]]+fData.ddDotTable[idx[1]]+fData.ddDotTable[idx[2]] ) );</div>
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>&#160;    }</div>
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>&#160;    Real Octree&lt; Degree &gt;::GetLaplacian( <span class="keyword">const</span> TreeOctNode* node1 , <span class="keyword">const</span> TreeOctNode* node2 )<span class="keyword"> const</span></div>
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>&#160;      <span class="keywordtype">int</span> symIndex[] =</div>
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>&#160;      {</div>
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>&#160;        BSplineData&lt; Degree , Real &gt;::SymmetricIndex( node1-&gt;off[0] , node2-&gt;off[0] ) ,</div>
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>&#160;        BSplineData&lt; Degree , Real &gt;::SymmetricIndex( node1-&gt;off[1] , node2-&gt;off[1] ) ,</div>
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>&#160;        BSplineData&lt; Degree , Real &gt;::SymmetricIndex( node1-&gt;off[2] , node2-&gt;off[2] )</div>
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>&#160;      };</div>
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>&#160;      <span class="keywordflow">return</span> GetLaplacian( symIndex );</div>
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>&#160;    }</div>
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>&#160;    Real Octree&lt; Degree &gt;::GetDivergence( <span class="keyword">const</span> TreeOctNode* node1 , <span class="keyword">const</span> TreeOctNode* node2 , <span class="keyword">const</span> <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a>&amp; normal1 )<span class="keyword"> const</span></div>
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>&#160;      <span class="keywordtype">int</span> symIndex[] =</div>
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>&#160;      {</div>
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>&#160;        BSplineData&lt; Degree , Real &gt;::SymmetricIndex( node1-&gt;off[0] , node2-&gt;off[0] ) ,</div>
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>&#160;        BSplineData&lt; Degree , Real &gt;::SymmetricIndex( node1-&gt;off[1] , node2-&gt;off[1] ) ,</div>
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>&#160;        BSplineData&lt; Degree , Real &gt;::SymmetricIndex( node1-&gt;off[2] , node2-&gt;off[2] ) ,</div>
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>&#160;      };</div>
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>&#160;      <span class="keywordtype">int</span> aSymIndex[] =</div>
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>&#160;      {</div>
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>&#160;<span class="preprocessor">  #if GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>&#160;        <span class="comment">// Take the dot-product of the vector-field with the gradient of the basis function</span></div>
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>&#160;        fData.Index( node2-&gt;off[0] , node1-&gt;off[0] ) ,</div>
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>&#160;        fData.Index( node2-&gt;off[1] , node1-&gt;off[1] ) ,</div>
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>&#160;        fData.Index( node2-&gt;off[2] , node1-&gt;off[2] )</div>
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>&#160;<span class="preprocessor">  #else </span><span class="comment">// !GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>&#160;        <span class="comment">// Take the dot-product of the divergence of the vector-field with the basis function</span></div>
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>&#160;        fData.Index( node1-&gt;off[0] , node2-&gt;off[0] ) ,</div>
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>&#160;        fData.Index( node1-&gt;off[1] , node2-&gt;off[1] ) ,</div>
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>&#160;        fData.Index( node1-&gt;off[2] , node2-&gt;off[2] )</div>
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>&#160;<span class="preprocessor">  #endif </span><span class="comment">// GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>&#160;      };</div>
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>&#160;      <span class="keywordtype">double</span> dot = fData.vvDotTable[symIndex[0]] * fData.vvDotTable[symIndex[1]] * fData.vvDotTable[symIndex[2]];</div>
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>&#160;<span class="preprocessor">#if GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>&#160;      <span class="keywordflow">return</span>  Real( dot * ( fData.dvDotTable[aSymIndex[0]]*normal1[0] + fData.dvDotTable[aSymIndex[1]]*normal1[1] + fData.dvDotTable[aSymIndex[2]]*normal1[2] ) );</div>
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>&#160;<span class="preprocessor">#else </span><span class="comment">// !GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>&#160;      <span class="keywordflow">return</span> -Real( dot * ( fData.dvDotTable[aSymIndex[0]]*normal1[0] + fData.dvDotTable[aSymIndex[1]]*normal1[1] + fData.dvDotTable[aSymIndex[2]]*normal1[2] ) );</div>
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>&#160;    }</div>
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>&#160;    Real Octree&lt; Degree &gt;::GetDivergenceMinusLaplacian( <span class="keyword">const</span> TreeOctNode* node1 , <span class="keyword">const</span> TreeOctNode* node2 , Real value1 , <span class="keyword">const</span> <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;Real&gt;</a>&amp; normal1 )<span class="keyword"> const</span></div>
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>&#160;      <span class="keywordtype">int</span> symIndex[] =</div>
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>&#160;      {</div>
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>&#160;        BSplineData&lt; Degree , Real &gt;::SymmetricIndex( node1-&gt;off[0] , node2-&gt;off[0] ) ,</div>
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>&#160;        BSplineData&lt; Degree , Real &gt;::SymmetricIndex( node1-&gt;off[1] , node2-&gt;off[1] ) ,</div>
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>&#160;        BSplineData&lt; Degree , Real &gt;::SymmetricIndex( node1-&gt;off[2] , node2-&gt;off[2] )</div>
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>&#160;      };</div>
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>&#160;      <span class="keywordtype">int</span> aSymIndex[] =</div>
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>&#160;      {</div>
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>&#160;<span class="preprocessor">  #if GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>&#160;        <span class="comment">// Take the dot-product of the vector-field with the gradient of the basis function</span></div>
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>&#160;        fData.Index( node2-&gt;off[0] , node1-&gt;off[0] ) ,</div>
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>&#160;        fData.Index( node2-&gt;off[1] , node1-&gt;off[1] ) ,</div>
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>&#160;        fData.Index( node2-&gt;off[2] , node1-&gt;off[2] )</div>
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>&#160;<span class="preprocessor">  #else </span><span class="comment">// !GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>&#160;        <span class="comment">// Take the dot-product of the divergence of the vector-field with the basis function</span></div>
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>&#160;        fData.Index( node1-&gt;off[0] , node2-&gt;off[0] ) ,</div>
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>&#160;        fData.Index( node1-&gt;off[1] , node2-&gt;off[1] ) ,</div>
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>&#160;        fData.Index( node1-&gt;off[2] , node2-&gt;off[2] )</div>
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>&#160;<span class="preprocessor">  #endif </span><span class="comment">// GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>&#160;      };</div>
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>&#160;      <span class="keywordtype">double</span> dot = fData.vvDotTable[symIndex[0]] * fData.vvDotTable[symIndex[1]] * fData.vvDotTable[symIndex[2]];</div>
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>&#160;      <span class="keywordflow">return</span> Real( dot *</div>
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>&#160;                   (</div>
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>&#160;               #<span class="keywordflow">if</span> GRADIENT_DOMAIN_SOLUTION</div>
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>&#160;                     - ( fData.ddDotTable[ symIndex[0]]            + fData.ddDotTable[ symIndex[1]]            + fData.ddDotTable[ symIndex[2]] ) * value1</div>
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>&#160;                     + ( fData.dvDotTable[aSymIndex[0]]*normal1[0] + fData.dvDotTable[aSymIndex[1]]*normal1[1] + fData.dvDotTable[aSymIndex[2]]*normal1[2] )</div>
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>&#160;               #<span class="keywordflow">else</span> <span class="comment">// !GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>&#160;                     - ( fData.ddDotTable[ symIndex[0]]            + fData.ddDotTable[ symIndex[1]]            + fData.ddDotTable[ symIndex[2]] ) * value1</div>
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>&#160;                     - ( fData.dvDotTable[aSymIndex[0]]*normal1[0] + fData.dvDotTable[aSymIndex[1]]*normal1[1] + fData.dvDotTable[aSymIndex[2]]*normal1[2] )</div>
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>&#160;               #endif <span class="comment">// GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>&#160;                     )</div>
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>&#160;                   );</div>
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>&#160;    }</div>
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>&#160;    <span class="keywordtype">void</span> Octree&lt; Degree &gt;::SetMatrixRowBounds( <span class="keyword">const</span> TreeOctNode* node , <span class="keywordtype">int</span> rDepth , <span class="keyword">const</span> <span class="keywordtype">int</span> rOff[3] , <span class="keywordtype">int</span>&amp; xStart , <span class="keywordtype">int</span>&amp; xEnd , <span class="keywordtype">int</span>&amp; yStart , <span class="keywordtype">int</span>&amp; yEnd , <span class="keywordtype">int</span>&amp; zStart , <span class="keywordtype">int</span>&amp; zEnd )<span class="keyword"> const</span></div>
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>&#160;      xStart = 0 , yStart = 0 , zStart = 0 , xEnd = 5 , yEnd = 5 , zEnd = 5;</div>
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>&#160;      <span class="keywordtype">int</span> depth , off[3];</div>
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>&#160;      node-&gt;depthAndOffset( depth , off );</div>
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>&#160;      <span class="keywordtype">int</span> width = 1 &lt;&lt; ( depth-rDepth );</div>
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>&#160;      off[0] -= rOff[0] &lt;&lt; ( depth-rDepth ) , off[1] -= rOff[1] &lt;&lt; ( depth-rDepth ) , off[2] -= rOff[2] &lt;&lt; ( depth-rDepth );</div>
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>&#160;      <span class="keywordflow">if</span>( off[0]&lt;0 ) xStart = -off[0];</div>
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>&#160;      <span class="keywordflow">if</span>( off[1]&lt;0 ) yStart = -off[1];</div>
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>&#160;      <span class="keywordflow">if</span>( off[2]&lt;0 ) zStart = -off[2];</div>
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>&#160;      <span class="keywordflow">if</span>( off[0]&gt;=width ) xEnd = 4 - ( off[0]-width );</div>
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>&#160;      <span class="keywordflow">if</span>( off[1]&gt;=width ) yEnd = 4 - ( off[1]-width );</div>
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>&#160;      <span class="keywordflow">if</span>( off[2]&gt;=width ) zEnd = 4 - ( off[2]-width );</div>
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>&#160;    }</div>
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>&#160;    <span class="keywordtype">int</span> Octree&lt; Degree &gt;::GetMatrixRowSize( <span class="keyword">const</span> OctNode&lt; TreeNodeData , Real &gt;::Neighbors5&amp; neighbors5 )<span class="keyword"> const </span>{ <span class="keywordflow">return</span> GetMatrixRowSize( neighbors5 , 0 , 5 , 0 , 5 , 0 , 5 ); }</div>
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>&#160;    <span class="keywordtype">int</span> Octree&lt; Degree &gt;::GetMatrixRowSize( <span class="keyword">const</span> OctNode&lt; TreeNodeData , Real &gt;::Neighbors5&amp; neighbors5 , <span class="keywordtype">int</span> xStart , <span class="keywordtype">int</span> xEnd , <span class="keywordtype">int</span> yStart , <span class="keywordtype">int</span> yEnd , <span class="keywordtype">int</span> zStart , <span class="keywordtype">int</span> zEnd )<span class="keyword"> const</span></div>
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>&#160;      <span class="keywordtype">int</span> count = 0;</div>
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=xStart ; x&lt;=2 ; x++ )</div>
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=yStart ; y&lt;yEnd ; y++ )</div>
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>&#160;          <span class="keywordflow">if</span>( x==2 &amp;&amp; y&gt;2 ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>&#160;          <span class="keywordflow">else</span> <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=zStart ; z&lt;zEnd ; z++ )</div>
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>&#160;            <span class="keywordflow">if</span>( x==2 &amp;&amp; y==2 &amp;&amp; z&gt;2 ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">if</span>( neighbors5.neighbors[x][y][z] &amp;&amp; neighbors5.neighbors[x][y][z]-&gt;nodeData.nodeIndex&gt;=0 )</div>
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>&#160;              count++;</div>
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>&#160;      <span class="keywordflow">return</span> count;</div>
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>&#160;    }</div>
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>&#160;    <span class="keywordtype">int</span> Octree&lt; Degree &gt;::SetMatrixRow( <span class="keyword">const</span> OctNode&lt; TreeNodeData , Real &gt;::Neighbors5&amp; neighbors5 , MatrixEntry&lt; float &gt;* row , <span class="keywordtype">int</span> offset , <span class="keyword">const</span> <span class="keywordtype">double</span> stencil[5][5][5] )<span class="keyword"> const</span></div>
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>&#160;      <span class="keywordflow">return</span> SetMatrixRow( neighbors5 , row , offset , stencil , 0 , 5 , 0 , 5 , 0 , 5 );</div>
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>&#160;    }</div>
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>&#160;    <span class="keywordtype">int</span> Octree&lt; Degree &gt;::SetMatrixRow( <span class="keyword">const</span> OctNode&lt; TreeNodeData , Real &gt;::Neighbors5&amp; neighbors5 , MatrixEntry&lt; float &gt;* row , <span class="keywordtype">int</span> offset , <span class="keyword">const</span> <span class="keywordtype">double</span> stencil[5][5][5] , <span class="keywordtype">int</span> xStart , <span class="keywordtype">int</span> xEnd , <span class="keywordtype">int</span> yStart , <span class="keywordtype">int</span> yEnd , <span class="keywordtype">int</span> zStart , <span class="keywordtype">int</span> zEnd )<span class="keyword"> const</span></div>
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>&#160;      <span class="keywordtype">bool</span> hasPoints[3][3];</div>
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>&#160;      Real diagonal = 0;</div>
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>&#160;      PointInfo samples[3][3][3];</div>
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>&#160; </div>
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>&#160;      <span class="keywordtype">int</span> count = 0;</div>
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>&#160;      <span class="keyword">const</span> TreeOctNode* node = neighbors5.neighbors[2][2][2];</div>
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>&#160;      <span class="keywordtype">int</span> index[] = { int( node-&gt;off[0] ) , int( node-&gt;off[1] ), int( node-&gt;off[2] ) };</div>
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>&#160; </div>
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>&#160;      <span class="keywordflow">if</span>( _constrainValues )</div>
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>&#160;      {</div>
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>&#160;        <span class="keywordtype">int</span> d , idx[3];</div>
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>&#160;        node-&gt;depthAndOffset( d , idx );</div>
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>&#160;        idx[0] = BinaryNode&lt; double &gt;::CenterIndex( d , idx[0] );</div>
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>&#160;        idx[1] = BinaryNode&lt; double &gt;::CenterIndex( d , idx[1] );</div>
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>&#160;        idx[2] = BinaryNode&lt; double &gt;::CenterIndex( d , idx[2] );</div>
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=0 ; j&lt;3 ; j++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> k=0 ; k&lt;3 ; k++ )</div>
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>&#160;        {</div>
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>&#160;          hasPoints[j][k] = <span class="keyword">false</span>;</div>
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> l=0 ; l&lt;3 ; l++ )</div>
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>&#160;          {</div>
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>&#160;            <span class="keyword">const</span> TreeOctNode* _node = neighbors5.neighbors[j+1][k+1][l+1];</div>
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>&#160;            <span class="keywordflow">if</span>( _node &amp;&amp; _node-&gt;nodeData.pointIndex!=-1 )</div>
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>&#160;            {</div>
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>&#160;              <span class="keyword">const</span> PointData&amp; pData = _points[ _node-&gt;nodeData.pointIndex ];</div>
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>&#160;              PointInfo&amp; pointInfo = samples[j][k][l];</div>
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>&#160;              Real weight = pData.weight;</div>
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>&#160;              <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> p = pData.position;</div>
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>&#160;              <span class="keywordflow">for</span>( <span class="keywordtype">int</span> s=0 ; s&lt;3 ; s++ )</div>
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>&#160;              {</div>
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>&#160;                pointInfo.splineValues[0][s] = float( fData.baseBSplines[ idx[0]+j-s][s]( p[0] ) );</div>
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>&#160;                pointInfo.splineValues[1][s] = float( fData.baseBSplines[ idx[1]+k-s][s]( p[1] ) );</div>
<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>&#160;                pointInfo.splineValues[2][s] = float( fData.baseBSplines[ idx[2]+l-s][s]( p[2] ) );</div>
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>&#160;              }</div>
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>&#160;              <span class="keywordtype">float</span> value = pointInfo.splineValues[0][j] * pointInfo.splineValues[1][k] * pointInfo.splineValues[2][l];</div>
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>&#160;              diagonal += value * value * weight;</div>
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>&#160;              pointInfo.weightedValue  = value * weight;</div>
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>&#160;              <span class="keywordflow">for</span>( <span class="keywordtype">int</span> s=0 ; s&lt;3 ; s++ ) pointInfo.splineValues[0][s] *= pointInfo.weightedValue;</div>
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>&#160;              hasPoints[j][k] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>&#160;            }</div>
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>&#160;            <span class="keywordflow">else</span> samples[j][k][l].weightedValue = 0;</div>
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>&#160;          }</div>
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>&#160;        }</div>
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>&#160;      }</div>
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>&#160; </div>
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>&#160;      <span class="keywordtype">bool</span> isInterior;</div>
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>&#160;      <span class="keywordtype">int</span> d , off[3];</div>
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>&#160;      neighbors5.neighbors[2][2][2]-&gt;depthAndOffset( d , off );</div>
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>&#160;      <span class="keywordtype">int</span> mn = 2 , mx = (1&lt;&lt;d)-2;</div>
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>&#160;      isInterior = ( off[0]&gt;=mn &amp;&amp; off[0]&lt;mx &amp;&amp; off[1]&gt;=mn &amp;&amp; off[1]&lt;mx &amp;&amp; off[2]&gt;=mn &amp;&amp; off[2]&lt;mx );</div>
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=xStart ; x&lt;=2 ; x++ )</div>
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=yStart ; y&lt;yEnd ; y++ )</div>
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>&#160;          <span class="keywordflow">if</span>( x==2 &amp;&amp; y&gt;2 ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>&#160;          <span class="keywordflow">else</span> <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=zStart ; z&lt;zEnd ; z++ )</div>
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>&#160;            <span class="keywordflow">if</span>( x==2 &amp;&amp; y==2 &amp;&amp; z&gt;2 ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">if</span>( neighbors5.neighbors[x][y][z] &amp;&amp; neighbors5.neighbors[x][y][z]-&gt;nodeData.nodeIndex&gt;=0 )</div>
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>&#160;            {</div>
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>&#160;              <span class="keyword">const</span> TreeOctNode* _node = neighbors5.neighbors[x][y][z];</div>
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>&#160;              <span class="keywordtype">int</span> _index[] = { int( _node-&gt;off[0] ) , int( _node-&gt;off[1] ), int( _node-&gt;off[2] ) };</div>
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>&#160;              Real temp;</div>
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>&#160;              <span class="keywordflow">if</span>( isInterior ) temp = Real( stencil[x][y][z] );</div>
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>&#160;              <span class="keywordflow">else</span>             temp = GetLaplacian( node , _node );</div>
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>&#160;              <span class="keywordflow">if</span>( _constrainValues )</div>
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>&#160;              {</div>
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>&#160;                <span class="keywordtype">int</span> _d[] = { _index[0]-index[0] , _index[1]-index[1] , _index[2]-index[2] };</div>
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>&#160;                <span class="keywordflow">if</span>( x==2 &amp;&amp; y==2 &amp;&amp; z==2 ) temp += diagonal;</div>
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>&#160;                <span class="keywordflow">else</span>                       temp += GetValue( samples , hasPoints , _d );</div>
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>&#160;              }</div>
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>&#160;              <span class="keywordflow">if</span>( x==2 &amp;&amp; y==2 &amp;&amp; z==2 ) temp /= 2;</div>
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>&#160;              <span class="keywordflow">if</span>( fabs(temp)&gt;MATRIX_ENTRY_EPSILON )</div>
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>&#160;              {</div>
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>&#160;                row[count].N = _node-&gt;nodeData.nodeIndex-offset;</div>
<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>&#160;                row[count].Value = temp;</div>
<div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>&#160;                count++;</div>
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>&#160;              }</div>
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>&#160;            }</div>
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>&#160;      <span class="keywordflow">return</span> count;</div>
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>&#160;    }</div>
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>&#160;    <span class="keywordtype">void</span> Octree&lt; Degree &gt;::SetDivergenceStencil( <span class="keywordtype">int</span> depth , <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; double &gt;</a> *stencil , <span class="keywordtype">bool</span> scatter )<span class="keyword"> const</span></div>
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>&#160;      <span class="keywordtype">int</span> offset[] = { 2 , 2 , 2 };</div>
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>&#160;      <span class="keywordtype">short</span> d , off[3];</div>
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>&#160;      TreeOctNode::Index( depth , offset , d , off );</div>
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>&#160;      <span class="keywordtype">int</span> index1[3] , index2[3];</div>
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>&#160;      <span class="keywordflow">if</span>( scatter ) index2[0] = int( off[0] ) , index2[1] = int( off[1] ) , index2[2] = int( off[2] );</div>
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>&#160;      <span class="keywordflow">else</span>          index1[0] = int( off[0] ) , index1[1] = int( off[1] ) , index1[2] = int( off[2] );</div>
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=0 ; x&lt;5 ; x++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=0 ; y&lt;5 ; y++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=0 ; z&lt;5 ; z++ )</div>
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>&#160;      {</div>
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>&#160;        <span class="keywordtype">int</span> _offset[] = { x , y , z };</div>
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>&#160;        TreeOctNode::Index( depth , _offset , d , off );</div>
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>&#160;        <span class="keywordflow">if</span>( scatter ) index1[0] = int( off[0] ) , index1[1] = int( off[1] ) , index1[2] = int( off[2] );</div>
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>&#160;        <span class="keywordflow">else</span>          index2[0] = int( off[0] ) , index2[1] = int( off[1] ) , index2[2] = int( off[2] );</div>
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>&#160;        <span class="keywordtype">int</span> symIndex[] =</div>
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>&#160;        {</div>
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>&#160;          BSplineData&lt; Degree , Real &gt;::SymmetricIndex( index1[0] , index2[0] ) ,</div>
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>&#160;          BSplineData&lt; Degree , Real &gt;::SymmetricIndex( index1[1] , index2[1] ) ,</div>
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>&#160;          BSplineData&lt; Degree , Real &gt;::SymmetricIndex( index1[2] , index2[2] ) ,</div>
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>&#160;        };</div>
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>&#160;        <span class="keywordtype">int</span> aSymIndex[] =</div>
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>&#160;        {</div>
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>&#160;<span class="preprocessor">  #if GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>&#160;          <span class="comment">// Take the dot-product of the vector-field with the gradient of the basis function</span></div>
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>&#160;          fData.Index( index1[0] , index2[0] ) ,</div>
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>&#160;          fData.Index( index1[1] , index2[1] ) ,</div>
<div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>&#160;          fData.Index( index1[2] , index2[2] )</div>
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>&#160;<span class="preprocessor">  #else </span><span class="comment">// !GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>&#160;          <span class="comment">// Take the dot-product of the divergence of the vector-field with the basis function</span></div>
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>&#160;          fData.Index( index2[0] , index1[0] ) ,</div>
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>&#160;          fData.Index( index2[1] , index1[1] ) ,</div>
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>&#160;          fData.Index( index2[2] , index1[2] )</div>
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>&#160;<span class="preprocessor">  #endif </span><span class="comment">// GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>&#160;        };</div>
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>&#160; </div>
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>&#160;        <span class="keywordtype">double</span> dot = fData.vvDotTable[symIndex[0]] * fData.vvDotTable[symIndex[1]] * fData.vvDotTable[symIndex[2]];</div>
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>&#160;<span class="preprocessor">#if GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>&#160;        <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;double&gt;</a> temp;</div>
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>&#160;        temp[0] = fData.dvDotTable[aSymIndex[0]] * dot;</div>
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>&#160;        temp[1] = fData.dvDotTable[aSymIndex[1]] * dot;</div>
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>&#160;        temp[2] = fData.dvDotTable[aSymIndex[2]] * dot;</div>
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>&#160;        stencil[25*x + 5*y + z] = temp;</div>
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>&#160;        <span class="comment">//        stencil[x][y][z][0] = fData.dvDotTable[aSymIndex[0]] * dot;</span></div>
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>&#160;        <span class="comment">//        stencil[x][y][z][1] = fData.dvDotTable[aSymIndex[1]] * dot;</span></div>
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>&#160;        <span class="comment">//        stencil[x][y][z][2] = fData.dvDotTable[aSymIndex[2]] * dot;</span></div>
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>&#160;<span class="preprocessor">#else </span><span class="comment">// !GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>&#160;        <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;double&gt;</a> temp;</div>
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>&#160;        temp[0] = -fData.dvDotTable[aSymIndex[0]] * dot;</div>
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>&#160;        temp[1] = -fData.dvDotTable[aSymIndex[1]] * dot;</div>
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>&#160;        temp[2] = -fData.dvDotTable[aSymIndex[2]] * dot;</div>
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>&#160;        stencil[25*x + 5*y + z] = temp;</div>
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>&#160;        <span class="comment">//        stencil[x][y][z][0] = -fData.dvDotTable[aSymIndex[0]] * dot;</span></div>
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>&#160;        <span class="comment">//        stencil[x][y][z][1] = -fData.dvDotTable[aSymIndex[1]] * dot;</span></div>
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>&#160;        <span class="comment">//        stencil[x][y][z][2] = -fData.dvDotTable[aSymIndex[2]] * dot;</span></div>
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>&#160;      }</div>
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>&#160;    }</div>
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>&#160;    <span class="keywordtype">void</span> Octree&lt; Degree &gt;::SetLaplacianStencil( <span class="keywordtype">int</span> depth , <span class="keywordtype">double</span> stencil[5][5][5] )<span class="keyword"> const</span></div>
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>&#160;      <span class="keywordtype">int</span> offset[] = { 2 , 2 , 2 };</div>
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>&#160;      <span class="keywordtype">short</span> d , off[3];</div>
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>&#160;      TreeOctNode::Index( depth , offset , d , off );</div>
<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>&#160;      <span class="keywordtype">int</span> index[] = { int( off[0] ) , int( off[1] ) , int( off[2] ) };</div>
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=0 ; x&lt;5 ; x++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=0 ; y&lt;5 ; y++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=0 ; z&lt;5 ; z++ )</div>
<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>&#160;      {</div>
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>&#160;        <span class="keywordtype">int</span> _offset[] = { x , y , z };</div>
<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>&#160;        <span class="keywordtype">short</span> _d , _off[3];</div>
<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>&#160;        TreeOctNode::Index( depth , _offset , _d , _off );</div>
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>&#160;        <span class="keywordtype">int</span> _index[] = { int( _off[0] ) , int( _off[1] ) , int( _off[2] ) };</div>
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>&#160;        <span class="keywordtype">int</span> symIndex[3];</div>
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>&#160;        symIndex[0] = BSplineData&lt; Degree , Real &gt;::SymmetricIndex( index[0] , _index[0] );</div>
<div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>&#160;        symIndex[1] = BSplineData&lt; Degree , Real &gt;::SymmetricIndex( index[1] , _index[1] );</div>
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>&#160;        symIndex[2] = BSplineData&lt; Degree , Real &gt;::SymmetricIndex( index[2] , _index[2] );</div>
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>&#160;        stencil[x][y][z] = GetLaplacian( symIndex );</div>
<div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>&#160;      }</div>
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>&#160;    }</div>
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>&#160;    <span class="keywordtype">void</span> Octree&lt; Degree &gt;::SetLaplacianStencils( <span class="keywordtype">int</span> depth , Stencil&lt; double , 5 &gt; stencils[2][2][2] )<span class="keyword"> const</span></div>
<div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>&#160;      <span class="keywordflow">if</span>( depth&lt;=1 ) <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;2 ; i++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=0 ; j&lt;2 ; j++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> k=0 ; k&lt;2 ; k++ )</div>
<div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>&#160;      {</div>
<div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>&#160;        <span class="keywordtype">short</span> d , off[3];</div>
<div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>&#160;        <span class="keywordtype">int</span> offset[] = { 4+i , 4+j , 4+k };</div>
<div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>&#160;        TreeOctNode::Index( depth , offset , d , off );</div>
<div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>&#160;        <span class="keywordtype">int</span> index[] = { int( off[0] ) , int( off[1] ) , int( off[2] ) };</div>
<div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=0 ; x&lt;5 ; x++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=0 ; y&lt;5 ; y++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=0 ; z&lt;5 ; z++ )</div>
<div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>&#160;        {</div>
<div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>&#160;          <span class="keywordtype">int</span> _offset[] = { x , y , z };</div>
<div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>&#160;          <span class="keywordtype">short</span> _d , _off[3];</div>
<div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>&#160;          TreeOctNode::Index( depth-1 , _offset , _d , _off );</div>
<div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>&#160;          <span class="keywordtype">int</span> _index[] = { int( _off[0] ) , int( _off[1] ) , int( _off[2] ) };</div>
<div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>&#160;          <span class="keywordtype">int</span> symIndex[3];</div>
<div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>&#160;          symIndex[0] = BSplineData&lt; Degree , Real &gt;::SymmetricIndex( index[0] , _index[0] );</div>
<div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>&#160;          symIndex[1] = BSplineData&lt; Degree , Real &gt;::SymmetricIndex( index[1] , _index[1] );</div>
<div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>&#160;          symIndex[2] = BSplineData&lt; Degree , Real &gt;::SymmetricIndex( index[2] , _index[2] );</div>
<div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>&#160;          stencils[i][j][k].values[x][y][z] = GetLaplacian( symIndex );</div>
<div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>&#160;        }</div>
<div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>&#160;      }</div>
<div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>&#160;    }</div>
<div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>&#160;    <span class="keywordtype">void</span> Octree&lt; Degree &gt;::SetDivergenceStencils( <span class="keywordtype">int</span> depth , Stencil&lt; <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; double &gt;</a> ,  5 &gt; stencils[2][2][2] , <span class="keywordtype">bool</span> scatter )<span class="keyword"> const</span></div>
<div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>&#160;      <span class="keywordflow">if</span>( depth&lt;=1 ) <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>&#160;      <span class="keywordtype">int</span> index1[3] , index2[3];</div>
<div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;2 ; i++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=0 ; j&lt;2 ; j++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> k=0 ; k&lt;2 ; k++ )</div>
<div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>&#160;      {</div>
<div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>&#160;        <span class="keywordtype">short</span> d , off[3];</div>
<div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>&#160;        <span class="keywordtype">int</span> offset[] = { 4+i , 4+j , 4+k };</div>
<div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>&#160;        TreeOctNode::Index( depth , offset , d , off );</div>
<div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>&#160;        <span class="keywordflow">if</span>( scatter ) index2[0] = int( off[0] ) , index2[1] = int( off[1] ) , index2[2] = int( off[2] );</div>
<div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>&#160;        <span class="keywordflow">else</span>          index1[0] = int( off[0] ) , index1[1] = int( off[1] ) , index1[2] = int( off[2] );</div>
<div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=0 ; x&lt;5 ; x++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=0 ; y&lt;5 ; y++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=0 ; z&lt;5 ; z++ )</div>
<div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>&#160;        {</div>
<div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>&#160;          <span class="keywordtype">int</span> _offset[] = { x , y , z };</div>
<div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>&#160;          TreeOctNode::Index( depth-1 , _offset , d , off );</div>
<div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>&#160;          <span class="keywordflow">if</span>( scatter ) index1[0] = int( off[0] ) , index1[1] = int( off[1] ) , index1[2] = int( off[2] );</div>
<div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>&#160;          <span class="keywordflow">else</span>          index2[0] = int( off[0] ) , index2[1] = int( off[1] ) , index2[2] = int( off[2] );</div>
<div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>&#160; </div>
<div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>&#160;          <span class="keywordtype">int</span> symIndex[] =</div>
<div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>&#160;          {</div>
<div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>&#160;            BSplineData&lt; Degree , Real &gt;::SymmetricIndex( index1[0] , index2[0] ) ,</div>
<div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>&#160;            BSplineData&lt; Degree , Real &gt;::SymmetricIndex( index1[1] , index2[1] ) ,</div>
<div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>&#160;            BSplineData&lt; Degree , Real &gt;::SymmetricIndex( index1[2] , index2[2] ) ,</div>
<div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>&#160;          };</div>
<div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>&#160;          <span class="keywordtype">int</span> aSymIndex[] =</div>
<div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>&#160;          {</div>
<div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>&#160;<span class="preprocessor">  #if GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>&#160;            <span class="comment">// Take the dot-product of the vector-field with the gradient of the basis function</span></div>
<div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>&#160;            fData.Index( index1[0] , index2[0] ) ,</div>
<div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>&#160;            fData.Index( index1[1] , index2[1] ) ,</div>
<div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>&#160;            fData.Index( index1[2] , index2[2] )</div>
<div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>&#160;<span class="preprocessor">  #else </span><span class="comment">// !GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>&#160;            <span class="comment">// Take the dot-product of the divergence of the vector-field with the basis function</span></div>
<div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>&#160;            fData.Index( index2[0] , index1[0] ) ,</div>
<div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>&#160;            fData.Index( index2[1] , index1[1] ) ,</div>
<div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>&#160;            fData.Index( index2[2] , index1[2] )</div>
<div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>&#160;<span class="preprocessor">  #endif </span><span class="comment">// GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>&#160;          };</div>
<div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>&#160;          <span class="keywordtype">double</span> dot = fData.vvDotTable[symIndex[0]] * fData.vvDotTable[symIndex[1]] * fData.vvDotTable[symIndex[2]];</div>
<div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>&#160;<span class="preprocessor">#if GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>&#160;          stencils[i][j][k].values[x][y][z][0] = fData.dvDotTable[aSymIndex[0]] * dot;</div>
<div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>&#160;          stencils[i][j][k].values[x][y][z][1] = fData.dvDotTable[aSymIndex[1]] * dot;</div>
<div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>&#160;          stencils[i][j][k].values[x][y][z][2] = fData.dvDotTable[aSymIndex[2]] * dot;</div>
<div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>&#160;<span class="preprocessor">#else </span><span class="comment">// !GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>&#160;          stencils[i][j][k].values[x][y][z][0] = -fData.dvDotTable[aSymIndex[0]] * dot;</div>
<div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>&#160;          stencils[i][j][k].values[x][y][z][1] = -fData.dvDotTable[aSymIndex[1]] * dot;</div>
<div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>&#160;          stencils[i][j][k].values[x][y][z][2] = -fData.dvDotTable[aSymIndex[2]] * dot;</div>
<div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// GRADIENT_DOMAIN_SOLUTION</span></div>
<div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>&#160;        }</div>
<div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>&#160;      }</div>
<div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>&#160;    }</div>
<div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>&#160;    <span class="keywordtype">void</span> Octree&lt; Degree &gt;::SetEvaluationStencils( <span class="keywordtype">int</span> depth , Stencil&lt; double ,  3 &gt; stencil1[8] , Stencil&lt; double , 3 &gt; stencil2[8][8] )<span class="keyword"> const</span></div>
<div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>&#160;      <span class="keywordflow">if</span>( depth&gt;2 )</div>
<div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>&#160;      {</div>
<div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>&#160;        <span class="keywordtype">int</span> idx[3];</div>
<div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>&#160;        <span class="keywordtype">int</span> off[] = { 2 , 2 , 2 };</div>
<div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> c=0 ; c&lt;8 ; c++ )</div>
<div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>&#160;        {</div>
<div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>&#160;          VertexData::CornerIndex( depth , off , c , fData.depth , idx );</div>
<div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>&#160;          idx[0] *= fData.functionCount , idx[1] *= fData.functionCount , idx[2] *= fData.functionCount;</div>
<div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=0 ; x&lt;3 ; x++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=0 ; y&lt;3 ; y++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=0 ; z&lt;3 ; z++ )</div>
<div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>&#160;          {</div>
<div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>&#160;            <span class="keywordtype">short</span> _d , _off[3];</div>
<div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>&#160;            <span class="keywordtype">int</span> _offset[] = { x+1 , y+1 , z+1 };</div>
<div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>&#160;            TreeOctNode::Index( depth , _offset , _d , _off );</div>
<div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>&#160;            stencil1[c].values[x][y][z] = fData.valueTables[ idx[0]+int(_off[0]) ] * fData.valueTables[ idx[1]+int(_off[1]) ] * fData.valueTables[ idx[2]+int(_off[2]) ];</div>
<div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>&#160;          }</div>
<div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>&#160;        }</div>
<div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>&#160;      }</div>
<div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>&#160;      <span class="keywordflow">if</span>( depth&gt;3 )</div>
<div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> _c=0 ; _c&lt;8 ; _c++ )</div>
<div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>&#160;        {</div>
<div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>&#160;          <span class="keywordtype">int</span> idx[3];</div>
<div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>&#160;          <span class="keywordtype">int</span> _cx , _cy , _cz;</div>
<div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>&#160;          Cube::FactorCornerIndex( _c , _cx , _cy , _cz );</div>
<div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>&#160;          <span class="keywordtype">int</span> off[] = { 4+_cx , 4+_cy , 4+_cz };</div>
<div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> c=0 ; c&lt;8 ; c++ )</div>
<div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>&#160;          {</div>
<div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>&#160;            VertexData::CornerIndex( depth , off , c , fData.depth , idx );</div>
<div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>&#160;            idx[0] *= fData.functionCount , idx[1] *= fData.functionCount , idx[2] *= fData.functionCount;</div>
<div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=0 ; x&lt;3 ; x++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=0 ; y&lt;3 ; y++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=0 ; z&lt;3 ; z++ )</div>
<div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>&#160;            {</div>
<div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>&#160;              <span class="keywordtype">short</span> _d , _off[3];</div>
<div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>&#160;              <span class="keywordtype">int</span> _offset[] = { x+1 , y+1 , z+1 };</div>
<div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>&#160;              TreeOctNode::Index( depth-1 , _offset , _d , _off );</div>
<div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>&#160;              stencil2[_c][c].values[x][y][z] = fData.valueTables[ idx[0]+int(_off[0]) ] * fData.valueTables[ idx[1]+int(_off[1]) ] * fData.valueTables[ idx[2]+int(_off[2]) ];</div>
<div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>&#160;            }</div>
<div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>&#160;          }</div>
<div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>&#160;        }</div>
<div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>&#160;    }</div>
<div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>&#160;    <span class="keywordtype">void</span> Octree&lt; Degree &gt;::UpdateCoarserSupportBounds( <span class="keyword">const</span> TreeOctNode* node , <span class="keywordtype">int</span>&amp; startX , <span class="keywordtype">int</span>&amp; endX , <span class="keywordtype">int</span>&amp; startY , <span class="keywordtype">int</span>&amp; endY , <span class="keywordtype">int</span>&amp; startZ , <span class="keywordtype">int</span>&amp; endZ )</div>
<div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>&#160;    {</div>
<div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>&#160;      <span class="keywordflow">if</span>( node-&gt;parent )</div>
<div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>&#160;      {</div>
<div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>&#160;        <span class="keywordtype">int</span> x , y , z , c = int( node - node-&gt;parent-&gt;children );</div>
<div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>&#160;        Cube::FactorCornerIndex( c , x , y , z );</div>
<div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>&#160;        <span class="keywordflow">if</span>( x==0 ) endX = 4;</div>
<div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>&#160;        <span class="keywordflow">else</span>     startX = 1;</div>
<div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>&#160;        <span class="keywordflow">if</span>( y==0 ) endY = 4;</div>
<div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>&#160;        <span class="keywordflow">else</span>     startY = 1;</div>
<div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>&#160;        <span class="keywordflow">if</span>( z==0 ) endZ = 4;</div>
<div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>&#160;        <span class="keywordflow">else</span>     startZ = 1;</div>
<div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>&#160;      }</div>
<div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>&#160;    }</div>
<div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>&#160; </div>
<div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>&#160;    <span class="keywordtype">void</span> Octree&lt; Degree &gt;::UpdateConstraintsFromCoarser( <span class="keyword">const</span> OctNode&lt; TreeNodeData , Real &gt;::NeighborKey5&amp; neighborKey5 , TreeOctNode* node , Real* metSolution , <span class="keyword">const</span> Stencil&lt; double , 5 &gt;&amp; lapStencil )<span class="keyword"> const</span></div>
<div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>&#160;      <span class="keywordtype">bool</span> isInterior;</div>
<div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>&#160;      {</div>
<div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>&#160;        <span class="keywordtype">int</span> d , off[3];</div>
<div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>&#160;        node-&gt;depthAndOffset( d , off );</div>
<div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>&#160;        <span class="keywordtype">int</span> mn = 4 , mx = (1&lt;&lt;d)-4;</div>
<div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>&#160;        isInterior = ( off[0]&gt;=mn &amp;&amp; off[0]&lt;mx &amp;&amp; off[1]&gt;=mn &amp;&amp; off[1]&lt;mx &amp;&amp; off[2]&gt;=mn &amp;&amp; off[2]&lt;mx );</div>
<div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>&#160;      }</div>
<div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>&#160;      Real constraint = Real( 0 );</div>
<div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>&#160;      <span class="keywordtype">int</span> depth = node-&gt;depth();</div>
<div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>&#160;      <span class="keywordflow">if</span>( depth&lt;=_minDepth ) <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>&#160;      <span class="keywordtype">int</span> i = node-&gt;nodeData.nodeIndex;</div>
<div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>&#160;      <span class="comment">// Offset the constraints using the solution from lower resolutions.</span></div>
<div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>&#160;      <span class="keywordtype">int</span> startX = 0 , endX = 5 , startY = 0 , endY = 5 , startZ = 0 , endZ = 5;</div>
<div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>&#160;      UpdateCoarserSupportBounds( node , startX , endX , startY  , endY , startZ , endZ );</div>
<div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>&#160; </div>
<div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>&#160;      <span class="keyword">const</span> TreeOctNode::Neighbors5&amp; neighbors5 = neighborKey5.neighbors[depth-1];</div>
<div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=startX ; x&lt;endX ; x++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=startY ; y&lt;endY ; y++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=startZ ; z&lt;endZ ; z++ )</div>
<div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>&#160;        <span class="keywordflow">if</span>( neighbors5.neighbors[x][y][z] &amp;&amp; neighbors5.neighbors[x][y][z]-&gt;nodeData.nodeIndex&gt;=0 )</div>
<div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>&#160;        {</div>
<div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>&#160;          <span class="keyword">const</span> TreeOctNode* _node = neighbors5.neighbors[x][y][z];</div>
<div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>&#160;          Real _solution = metSolution[ _node-&gt;nodeData.nodeIndex ];</div>
<div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>&#160;          {</div>
<div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>&#160;            <span class="keywordflow">if</span>( isInterior ) node-&gt;nodeData.constraint -= Real( lapStencil.values[x][y][z] * _solution );</div>
<div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>&#160;            <span class="keywordflow">else</span>             node-&gt;nodeData.constraint -= GetLaplacian( _node , node ) * _solution;</div>
<div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>&#160;          }</div>
<div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>&#160;        }</div>
<div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>&#160;      <span class="keywordflow">if</span>( _constrainValues )</div>
<div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>&#160;      {</div>
<div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>&#160;        <span class="keywordtype">int</span> d , idx[3];</div>
<div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>&#160;        node-&gt;depthAndOffset( d, idx );</div>
<div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>&#160;        idx[0] = BinaryNode&lt; double &gt;::CenterIndex( d , idx[0] );</div>
<div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>&#160;        idx[1] = BinaryNode&lt; double &gt;::CenterIndex( d , idx[1] );</div>
<div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>&#160;        idx[2] = BinaryNode&lt; double &gt;::CenterIndex( d , idx[2] );</div>
<div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>&#160;        <span class="keyword">const</span> TreeOctNode::Neighbors5&amp; neighbors5 = neighborKey5.neighbors[depth];</div>
<div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=1 ; x&lt;4 ; x++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=1 ; y&lt;4 ; y++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=1 ; z&lt;4 ; z++ )</div>
<div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>&#160;          <span class="keywordflow">if</span>( neighbors5.neighbors[x][y][z] &amp;&amp; neighbors5.neighbors[x][y][z]-&gt;nodeData.pointIndex!=-1 )</div>
<div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>&#160;          {</div>
<div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>&#160;            <span class="keyword">const</span> PointData&amp; pData = _points[ neighbors5.neighbors[x][y][z]-&gt;nodeData.pointIndex ];</div>
<div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>&#160;            Real pointValue = pData.value;</div>
<div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>&#160;            <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> p = pData.position;</div>
<div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>&#160;            node-&gt;nodeData.constraint -=</div>
<div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>&#160;                Real(</div>
<div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>&#160;                  fData.baseBSplines[idx[0]][x-1]( p[0] ) *</div>
<div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>&#160;                  fData.baseBSplines[idx[1]][y-1]( p[1] ) *</div>
<div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>&#160;                  fData.baseBSplines[idx[2]][z-1]( p[2] ) *</div>
<div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>&#160;                  pointValue</div>
<div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>&#160;                  );</div>
<div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>&#160;          }</div>
<div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>&#160;      }</div>
<div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>&#160;    }</div>
<div class="line"><a name="l01472"></a><span class="lineno"><a class="line" href="structpcl_1_1poisson_1_1_up_sample_data.html"> 1472</a></span>&#160;    <span class="keyword">struct </span><a class="code" href="structpcl_1_1poisson_1_1_up_sample_data.html">UpSampleData</a></div>
<div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>&#160;    {</div>
<div class="line"><a name="l01474"></a><span class="lineno"> 1474</span>&#160;        <span class="keywordtype">int</span> start;</div>
<div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>&#160;        <span class="keywordtype">double</span> v[2];</div>
<div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>&#160;        <a class="code" href="structpcl_1_1poisson_1_1_up_sample_data.html">UpSampleData</a>( <span class="keywordtype">void</span> ) { start = 0 , v[0] = v[1] = 0.; }</div>
<div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>&#160;        <a class="code" href="structpcl_1_1poisson_1_1_up_sample_data.html">UpSampleData</a>( <span class="keywordtype">int</span> s , <span class="keywordtype">double</span> v1 , <span class="keywordtype">double</span> v2 ) { start = s , v[0] = v1 , v[1] = v2; }</div>
<div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>&#160;    };</div>
<div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>&#160;    <span class="keywordtype">void</span> <a class="code" href="classpcl_1_1poisson_1_1_octree.html">Octree&lt; Degree &gt;::UpSampleCoarserSolution</a>( <span class="keywordtype">int</span> depth , <span class="keyword">const</span> <a class="code" href="classpcl_1_1poisson_1_1_sorted_tree_nodes.html">SortedTreeNodes</a>&amp; sNodes , <a class="code" href="classpcl_1_1poisson_1_1_vector.html">Vector&lt; Real &gt;</a>&amp; Solution )<span class="keyword"> const</span></div>
<div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>&#160;      <span class="keywordtype">int</span> start = sNodes.nodeCount[depth] , end = sNodes.nodeCount[depth+1] , range = end-start;</div>
<div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>&#160;      Solution.Resize( range );</div>
<div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>&#160;      <span class="keywordflow">if</span>( !depth ) <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>&#160;      <span class="keywordflow">else</span> <span class="keywordflow">if</span>( depth==1 ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=start ; i&lt;end ; i++ ) Solution[i-start] += sNodes.treeNodes[0]-&gt;nodeData.solution;</div>
<div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>&#160;      <span class="keywordflow">else</span></div>
<div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>&#160;      {</div>
<div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>&#160;        <span class="comment">// For every node at the current depth</span></div>
<div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>&#160;#pragma omp parallel <span class="keywordflow">for</span> num_threads( threads )</div>
<div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ )</div>
<div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>&#160;        {</div>
<div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>&#160;          TreeOctNode::NeighborKey3 neighborKey;</div>
<div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>&#160;          neighborKey.set( depth );</div>
<div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=start+(range*t)/threads ; i&lt;start+(range*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>&#160;          {</div>
<div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>&#160;            <span class="keywordtype">int</span> d , off[3];</div>
<div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>&#160;            <a class="code" href="structpcl_1_1poisson_1_1_up_sample_data.html">UpSampleData</a> usData[3];</div>
<div class="line"><a name="l01498"></a><span class="lineno"> 1498</span>&#160;            sNodes.treeNodes[i]-&gt;depthAndOffset( d , off );</div>
<div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=0 ; d&lt;3 ; d++ )</div>
<div class="line"><a name="l01500"></a><span class="lineno"> 1500</span>&#160;            {</div>
<div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>&#160;              <span class="keywordflow">if</span>     ( off[d]  ==0          ) usData[d] = <a class="code" href="structpcl_1_1poisson_1_1_up_sample_data.html">UpSampleData</a>( 1 , 1.00 , 0.00 );</div>
<div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>&#160;              <span class="keywordflow">else</span> <span class="keywordflow">if</span>( off[d]+1==(1&lt;&lt;depth) ) usData[d] = <a class="code" href="structpcl_1_1poisson_1_1_up_sample_data.html">UpSampleData</a>( 0 , 0.00 , 1.00 );</div>
<div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>&#160;              <span class="keywordflow">else</span> <span class="keywordflow">if</span>( off[d]%2             ) usData[d] = <a class="code" href="structpcl_1_1poisson_1_1_up_sample_data.html">UpSampleData</a>( 1 , 0.75 , 0.25 );</div>
<div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>&#160;              <span class="keywordflow">else</span>                            usData[d] = <a class="code" href="structpcl_1_1poisson_1_1_up_sample_data.html">UpSampleData</a>( 0 , 0.25 , 0.75 );</div>
<div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>&#160;            }</div>
<div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>&#160;            neighborKey.getNeighbors( sNodes.treeNodes[i] );</div>
<div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> ii=0 ; ii&lt;2 ; ii++ )</div>
<div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>&#160;            {</div>
<div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>&#160;              <span class="keywordtype">int</span> _ii = ii + usData[0].start;</div>
<div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>&#160;              <span class="keywordtype">double</span> dx = usData[0].v[ii];</div>
<div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>&#160;              <span class="keywordflow">for</span>( <span class="keywordtype">int</span> jj=0 ; jj&lt;2 ; jj++ )</div>
<div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>&#160;              {</div>
<div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>&#160;                <span class="keywordtype">int</span> _jj = jj + usData[1].start;</div>
<div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>&#160;                <span class="keywordtype">double</span> dxy = dx * usData[1].v[jj];</div>
<div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>&#160;                <span class="keywordflow">for</span>( <span class="keywordtype">int</span> kk=0 ; kk&lt;2 ; kk++ )</div>
<div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>&#160;                {</div>
<div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>&#160;                  <span class="keywordtype">int</span> _kk = kk + usData[2].start;</div>
<div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>&#160;                  <span class="keywordtype">double</span> dxyz = dxy * usData[2].v[kk];</div>
<div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>&#160;                  Solution[i-start] += Real( neighborKey.neighbors[depth-1].neighbors[_ii][_jj][_kk]-&gt;nodeData.solution * dxyz );</div>
<div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>&#160;                }</div>
<div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>&#160;              }</div>
<div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>&#160;            }</div>
<div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>&#160;          }</div>
<div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>&#160;        }</div>
<div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>&#160;      }</div>
<div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>&#160;      <span class="comment">// Clear the coarser solution</span></div>
<div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>&#160;      start = sNodes.nodeCount[depth-1] , end = sNodes.nodeCount[depth] , range = end-start;</div>
<div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=start ; i&lt;end ; i++ ) sNodes.treeNodes[i]-&gt;nodeData.solution = Real( 0. );</div>
<div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>&#160;    }</div>
<div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>&#160;    <span class="keywordtype">void</span> Octree&lt; Degree &gt;::DownSampleFinerConstraints( <span class="keywordtype">int</span> depth , SortedTreeNodes&amp; sNodes )<span class="keyword"> const</span></div>
<div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>&#160;      <span class="keywordflow">if</span>( !depth ) <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=sNodes.nodeCount[depth-1] ; i&lt;sNodes.nodeCount[depth] ; i++ )</div>
<div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>&#160;        sNodes.treeNodes[i]-&gt;nodeData.constraint = Real( 0 );</div>
<div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>&#160; </div>
<div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>&#160;      <span class="keywordflow">if</span>( depth==1 )</div>
<div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>&#160;      {</div>
<div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>&#160;        sNodes.treeNodes[0]-&gt;nodeData.constraint = Real( 0 );</div>
<div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=sNodes.nodeCount[depth] ; i&lt;sNodes.nodeCount[depth+1] ; i++ ) sNodes.treeNodes[0]-&gt;nodeData.constraint += sNodes.treeNodes[i]-&gt;nodeData.constraint;</div>
<div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>&#160;        <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>&#160;      }</div>
<div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>&#160;      std::vector&lt; Vector&lt; double &gt; &gt; constraints( threads );</div>
<div class="line"><a name="l01546"></a><span class="lineno"> 1546</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ ) constraints[t].Resize( sNodes.nodeCount[depth] - sNodes.nodeCount[depth-1] ) , constraints[t].SetZero();</div>
<div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>&#160;      <span class="keywordtype">int</span> start = sNodes.nodeCount[depth] , end = sNodes.nodeCount[depth+1] , range = end-start;</div>
<div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>&#160;      <span class="keywordtype">int</span> lStart = sNodes.nodeCount[depth-1] , lEnd = sNodes.nodeCount[depth];</div>
<div class="line"><a name="l01549"></a><span class="lineno"> 1549</span>&#160;      <span class="comment">// For every node at the current depth</span></div>
<div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l01551"></a><span class="lineno"> 1551</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ )</div>
<div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>&#160;      {</div>
<div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>&#160;        TreeOctNode::NeighborKey3 neighborKey;</div>
<div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>&#160;        neighborKey.set( depth );</div>
<div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=start+(range*t)/threads ; i&lt;start+(range*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>&#160;        {</div>
<div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>&#160;          <span class="keywordtype">int</span> d , off[3];</div>
<div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>&#160;          UpSampleData usData[3];</div>
<div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>&#160;          sNodes.treeNodes[i]-&gt;depthAndOffset( d , off );</div>
<div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=0 ; d&lt;3 ; d++ )</div>
<div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>&#160;          {</div>
<div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>&#160;            <span class="keywordflow">if</span>     ( off[d]  ==0          ) usData[d] = UpSampleData( 1 , 1.00 , 0.00 );</div>
<div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">if</span>( off[d]+1==(1&lt;&lt;depth) ) usData[d] = UpSampleData( 0 , 0.00 , 1.00 );</div>
<div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">if</span>( off[d]%2             ) usData[d] = UpSampleData( 1 , 0.75 , 0.25 );</div>
<div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>&#160;            <span class="keywordflow">else</span>                            usData[d] = UpSampleData( 0 , 0.25 , 0.75 );</div>
<div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>&#160;          }</div>
<div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>&#160;          neighborKey.getNeighbors( sNodes.treeNodes[i] );</div>
<div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>&#160;          TreeOctNode::Neighbors3&amp; neighbors = neighborKey.neighbors[depth-1];</div>
<div class="line"><a name="l01569"></a><span class="lineno"> 1569</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> ii=0 ; ii&lt;2 ; ii++ )</div>
<div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>&#160;          {</div>
<div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>&#160;            <span class="keywordtype">int</span> _ii = ii + usData[0].start;</div>
<div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>&#160;            <span class="keywordtype">double</span> dx = usData[0].v[ii];</div>
<div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> jj=0 ; jj&lt;2 ; jj++ )</div>
<div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>&#160;            {</div>
<div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>&#160;              <span class="keywordtype">int</span> _jj = jj + usData[1].start;</div>
<div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>&#160;              <span class="keywordtype">double</span> dxy = dx * usData[1].v[jj];</div>
<div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>&#160;              <span class="keywordflow">for</span>( <span class="keywordtype">int</span> kk=0 ; kk&lt;2 ; kk++ )</div>
<div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>&#160;              {</div>
<div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>&#160;                <span class="keywordtype">int</span> _kk = kk + usData[2].start;</div>
<div class="line"><a name="l01580"></a><span class="lineno"> 1580</span>&#160;                <span class="keywordtype">double</span> dxyz = dxy * usData[2].v[kk];</div>
<div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>&#160;                constraints[t][neighbors.neighbors[_ii][_jj][_kk]-&gt;nodeData.nodeIndex-lStart] += sNodes.treeNodes[i]-&gt;nodeData.constraint * dxyz;</div>
<div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>&#160;              }</div>
<div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>&#160;            }</div>
<div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>&#160;          }</div>
<div class="line"><a name="l01585"></a><span class="lineno"> 1585</span>&#160;        }</div>
<div class="line"><a name="l01586"></a><span class="lineno"> 1586</span>&#160;      }</div>
<div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=lStart ; i&lt;lEnd ; i++ )</div>
<div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>&#160;      {</div>
<div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>&#160;        Real cSum = Real(0.);</div>
<div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ ) cSum += constraints[t][i-lStart];</div>
<div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>&#160;        sNodes.treeNodes[i]-&gt;nodeData.constraint += cSum;</div>
<div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>&#160;      }</div>
<div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>&#160;    }</div>
<div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>&#160;    <span class="keyword">template</span>&lt; <span class="keyword">class</span> C &gt;</div>
<div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>&#160;    <span class="keywordtype">void</span> Octree&lt; Degree &gt;::DownSample( <span class="keywordtype">int</span> depth , <span class="keyword">const</span> SortedTreeNodes&amp; sNodes , C* constraints )<span class="keyword"> const</span></div>
<div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>&#160;      <span class="keywordflow">if</span>( depth==0 ) <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l01600"></a><span class="lineno"> 1600</span>&#160;      <span class="keywordflow">if</span>( depth==1 )</div>
<div class="line"><a name="l01601"></a><span class="lineno"> 1601</span>&#160;      {</div>
<div class="line"><a name="l01602"></a><span class="lineno"> 1602</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=sNodes.nodeCount[1] ; i&lt;sNodes.nodeCount[2] ; i++ ) constraints[0] += constraints[i];</div>
<div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>&#160;        <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>&#160;      }</div>
<div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>&#160;      std::vector&lt; Vector&lt; C &gt; &gt; _constraints( threads );</div>
<div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ ) _constraints[t].Resize( sNodes.nodeCount[depth] - sNodes.nodeCount[depth-1] );</div>
<div class="line"><a name="l01607"></a><span class="lineno"> 1607</span>&#160;      <span class="keywordtype">int</span> start = sNodes.nodeCount[depth] , end = sNodes.nodeCount[depth+1] , range = end-start , lStart = sNodes.nodeCount[depth-1] , lEnd = sNodes.nodeCount[depth];</div>
<div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>&#160;      <span class="comment">// For every node at the current depth</span></div>
<div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l01610"></a><span class="lineno"> 1610</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ )</div>
<div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>&#160;      {</div>
<div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>&#160;        TreeOctNode::NeighborKey3 neighborKey;</div>
<div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>&#160;        neighborKey.set( depth );</div>
<div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=start+(range*t)/threads ; i&lt;start+(range*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>&#160;        {</div>
<div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>&#160;          <span class="keywordtype">int</span> d , off[3];</div>
<div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>&#160;          UpSampleData usData[3];</div>
<div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>&#160;          sNodes.treeNodes[i]-&gt;depthAndOffset( d , off );</div>
<div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=0 ; d&lt;3 ; d++ )</div>
<div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>&#160;          {</div>
<div class="line"><a name="l01621"></a><span class="lineno"> 1621</span>&#160;            <span class="keywordflow">if</span>     ( off[d]  ==0          ) usData[d] = UpSampleData( 1 , 1.00 , 0.00 );</div>
<div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">if</span>( off[d]+1==(1&lt;&lt;depth) ) usData[d] = UpSampleData( 0 , 0.00 , 1.00 );</div>
<div class="line"><a name="l01623"></a><span class="lineno"> 1623</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">if</span>( off[d]%2             ) usData[d] = UpSampleData( 1 , 0.75 , 0.25 );</div>
<div class="line"><a name="l01624"></a><span class="lineno"> 1624</span>&#160;            <span class="keywordflow">else</span>                            usData[d] = UpSampleData( 0 , 0.25 , 0.75 );</div>
<div class="line"><a name="l01625"></a><span class="lineno"> 1625</span>&#160;          }</div>
<div class="line"><a name="l01626"></a><span class="lineno"> 1626</span>&#160;          TreeOctNode::Neighbors3&amp; neighbors = neighborKey.getNeighbors( sNodes.treeNodes[i]-&gt;parent );</div>
<div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>&#160;          C c = constraints[i];</div>
<div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> ii=0 ; ii&lt;2 ; ii++ )</div>
<div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>&#160;          {</div>
<div class="line"><a name="l01630"></a><span class="lineno"> 1630</span>&#160;            <span class="keywordtype">int</span> _ii = ii + usData[0].start;</div>
<div class="line"><a name="l01631"></a><span class="lineno"> 1631</span>&#160;            C cx = C( c*usData[0].v[ii] );</div>
<div class="line"><a name="l01632"></a><span class="lineno"> 1632</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> jj=0 ; jj&lt;2 ; jj++ )</div>
<div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>&#160;            {</div>
<div class="line"><a name="l01634"></a><span class="lineno"> 1634</span>&#160;              <span class="keywordtype">int</span> _jj = jj + usData[1].start;</div>
<div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>&#160;              C cxy = C( cx*usData[1].v[jj] );</div>
<div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>&#160;              <span class="keywordflow">for</span>( <span class="keywordtype">int</span> kk=0 ; kk&lt;2 ; kk++ )</div>
<div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>&#160;              {</div>
<div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>&#160;                <span class="keywordtype">int</span> _kk = kk + usData[2].start;</div>
<div class="line"><a name="l01639"></a><span class="lineno"> 1639</span>&#160;                <span class="keywordflow">if</span>( neighbors.neighbors[_ii][_jj][_kk] )</div>
<div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>&#160;                  _constraints[t][neighbors.neighbors[_ii][_jj][_kk]-&gt;nodeData.nodeIndex-lStart] += C( cxy*usData[2].v[kk] );</div>
<div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>&#160;              }</div>
<div class="line"><a name="l01642"></a><span class="lineno"> 1642</span>&#160;            }</div>
<div class="line"><a name="l01643"></a><span class="lineno"> 1643</span>&#160;          }</div>
<div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>&#160;        }</div>
<div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>&#160;      }</div>
<div class="line"><a name="l01646"></a><span class="lineno"> 1646</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=lStart ; i&lt;lEnd ; i++ )</div>
<div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>&#160;      {</div>
<div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>&#160;        C cSum = C(0);</div>
<div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ ) cSum += _constraints[t][i-lStart];</div>
<div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>&#160;        constraints[i] += cSum;</div>
<div class="line"><a name="l01652"></a><span class="lineno"> 1652</span>&#160;      }</div>
<div class="line"><a name="l01653"></a><span class="lineno"> 1653</span>&#160;    }</div>
<div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>&#160;    <span class="keyword">template</span>&lt; <span class="keyword">class</span> C &gt;</div>
<div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>&#160;    <span class="keywordtype">void</span> Octree&lt; Degree &gt;::UpSample( <span class="keywordtype">int</span> depth , <span class="keyword">const</span> SortedTreeNodes&amp; sNodes , C* coefficients )<span class="keyword"> const</span></div>
<div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>&#160;      <span class="keywordflow">if</span>     ( depth==0 ) <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>&#160;      <span class="keywordflow">else</span> <span class="keywordflow">if</span>( depth==1 )</div>
<div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>&#160;      {</div>
<div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=sNodes.nodeCount[1] ; i&lt;sNodes.nodeCount[2] ; i++ ) coefficients[i] += coefficients[0];</div>
<div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>&#160;        <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>&#160;      }</div>
<div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>&#160; </div>
<div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>&#160;      <span class="keywordtype">int</span> start = sNodes.nodeCount[depth] , end = sNodes.nodeCount[depth+1] , range = end-start;</div>
<div class="line"><a name="l01666"></a><span class="lineno"> 1666</span>&#160;      <span class="comment">// For every node at the current depth</span></div>
<div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ )</div>
<div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>&#160;      {</div>
<div class="line"><a name="l01670"></a><span class="lineno"> 1670</span>&#160;        TreeOctNode::NeighborKey3 neighborKey;</div>
<div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>&#160;        neighborKey.set( depth-1 );</div>
<div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=start+(range*t)/threads ; i&lt;start+(range*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>&#160;        {</div>
<div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>&#160;          TreeOctNode* node = sNodes.treeNodes[i];</div>
<div class="line"><a name="l01675"></a><span class="lineno"> 1675</span>&#160;          <span class="keywordtype">int</span> d , off[3];</div>
<div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>&#160;          UpSampleData usData[3];</div>
<div class="line"><a name="l01677"></a><span class="lineno"> 1677</span>&#160;          node-&gt;depthAndOffset( d , off );</div>
<div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=0 ; d&lt;3 ; d++ )</div>
<div class="line"><a name="l01679"></a><span class="lineno"> 1679</span>&#160;          {</div>
<div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>&#160;            <span class="keywordflow">if</span>     ( off[d]  ==0          ) usData[d] = UpSampleData( 1 , 1.00 , 0.00 );</div>
<div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">if</span>( off[d]+1==(1&lt;&lt;depth) ) usData[d] = UpSampleData( 0 , 0.00 , 1.00 );</div>
<div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">if</span>( off[d]%2             ) usData[d] = UpSampleData( 1 , 0.75 , 0.25 );</div>
<div class="line"><a name="l01683"></a><span class="lineno"> 1683</span>&#160;            <span class="keywordflow">else</span>                            usData[d] = UpSampleData( 0 , 0.25 , 0.75 );</div>
<div class="line"><a name="l01684"></a><span class="lineno"> 1684</span>&#160;          }</div>
<div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>&#160;          TreeOctNode::Neighbors3&amp; neighbors = neighborKey.getNeighbors( node-&gt;parent );</div>
<div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> ii=0 ; ii&lt;2 ; ii++ )</div>
<div class="line"><a name="l01687"></a><span class="lineno"> 1687</span>&#160;          {</div>
<div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>&#160;            <span class="keywordtype">int</span> _ii = ii + usData[0].start;</div>
<div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>&#160;            <span class="keywordtype">double</span> dx = usData[0].v[ii];</div>
<div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> jj=0 ; jj&lt;2 ; jj++ )</div>
<div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>&#160;            {</div>
<div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>&#160;              <span class="keywordtype">int</span> _jj = jj + usData[1].start;</div>
<div class="line"><a name="l01693"></a><span class="lineno"> 1693</span>&#160;              <span class="keywordtype">double</span> dxy = dx * usData[1].v[jj];</div>
<div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>&#160;              <span class="keywordflow">for</span>( <span class="keywordtype">int</span> kk=0 ; kk&lt;2 ; kk++ )</div>
<div class="line"><a name="l01695"></a><span class="lineno"> 1695</span>&#160;              {</div>
<div class="line"><a name="l01696"></a><span class="lineno"> 1696</span>&#160;                <span class="keywordtype">int</span> _kk = kk + usData[2].start;</div>
<div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>&#160;                <span class="keywordflow">if</span>( neighbors.neighbors[_ii][_jj][_kk] )</div>
<div class="line"><a name="l01698"></a><span class="lineno"> 1698</span>&#160;                {</div>
<div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>&#160;                  <span class="keywordtype">double</span> dxyz = dxy * usData[2].v[kk];</div>
<div class="line"><a name="l01700"></a><span class="lineno"> 1700</span>&#160;                  <span class="keywordtype">int</span> _i = neighbors.neighbors[_ii][_jj][_kk]-&gt;nodeData.nodeIndex;</div>
<div class="line"><a name="l01701"></a><span class="lineno"> 1701</span>&#160;                  coefficients[i] += coefficients[_i] * Real( dxyz );</div>
<div class="line"><a name="l01702"></a><span class="lineno"> 1702</span>&#160;                }</div>
<div class="line"><a name="l01703"></a><span class="lineno"> 1703</span>&#160;              }</div>
<div class="line"><a name="l01704"></a><span class="lineno"> 1704</span>&#160;            }</div>
<div class="line"><a name="l01705"></a><span class="lineno"> 1705</span>&#160;          }</div>
<div class="line"><a name="l01706"></a><span class="lineno"> 1706</span>&#160;        }</div>
<div class="line"><a name="l01707"></a><span class="lineno"> 1707</span>&#160;      }</div>
<div class="line"><a name="l01708"></a><span class="lineno"> 1708</span>&#160;    }</div>
<div class="line"><a name="l01709"></a><span class="lineno"> 1709</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01710"></a><span class="lineno"> 1710</span>&#160;    <span class="keywordtype">void</span> Octree&lt; Degree &gt;::SetCoarserPointValues( <span class="keywordtype">int</span> depth , <span class="keyword">const</span> SortedTreeNodes&amp; sNodes , Real* metSolution )</div>
<div class="line"><a name="l01711"></a><span class="lineno"> 1711</span>&#160;    {</div>
<div class="line"><a name="l01712"></a><span class="lineno"> 1712</span>&#160;      <span class="keywordtype">int</span> start = sNodes.nodeCount[depth] , end = sNodes.nodeCount[depth+1] , range = end-start;</div>
<div class="line"><a name="l01713"></a><span class="lineno"> 1713</span>&#160;      <span class="comment">// For every node at the current depth</span></div>
<div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l01715"></a><span class="lineno"> 1715</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ )</div>
<div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>&#160;      {</div>
<div class="line"><a name="l01717"></a><span class="lineno"> 1717</span>&#160;        TreeOctNode::NeighborKey3 neighborKey;</div>
<div class="line"><a name="l01718"></a><span class="lineno"> 1718</span>&#160;        neighborKey.set( depth );</div>
<div class="line"><a name="l01719"></a><span class="lineno"> 1719</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=start+(range*t)/threads ; i&lt;start+(range*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l01720"></a><span class="lineno"> 1720</span>&#160;        {</div>
<div class="line"><a name="l01721"></a><span class="lineno"> 1721</span>&#160;          <span class="keywordtype">int</span> pIdx = sNodes.treeNodes[i]-&gt;nodeData.pointIndex;</div>
<div class="line"><a name="l01722"></a><span class="lineno"> 1722</span>&#160;          <span class="keywordflow">if</span>( pIdx!=-1 )</div>
<div class="line"><a name="l01723"></a><span class="lineno"> 1723</span>&#160;          {</div>
<div class="line"><a name="l01724"></a><span class="lineno"> 1724</span>&#160;            neighborKey.getNeighbors( sNodes.treeNodes[i] );</div>
<div class="line"><a name="l01725"></a><span class="lineno"> 1725</span>&#160;            _points[ pIdx ].value = WeightedCoarserFunctionValue( neighborKey , sNodes.treeNodes[i] , metSolution );</div>
<div class="line"><a name="l01726"></a><span class="lineno"> 1726</span>&#160;          }</div>
<div class="line"><a name="l01727"></a><span class="lineno"> 1727</span>&#160;        }</div>
<div class="line"><a name="l01728"></a><span class="lineno"> 1728</span>&#160;      }</div>
<div class="line"><a name="l01729"></a><span class="lineno"> 1729</span>&#160;    }</div>
<div class="line"><a name="l01730"></a><span class="lineno"> 1730</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l01731"></a><span class="lineno"> 1731</span>&#160;    Real Octree&lt; Degree &gt;::WeightedCoarserFunctionValue( <span class="keyword">const</span> OctNode&lt; TreeNodeData , Real &gt;::NeighborKey3&amp; neighborKey , <span class="keyword">const</span> TreeOctNode* pointNode , Real* metSolution )<span class="keyword"> const</span></div>
<div class="line"><a name="l01732"></a><span class="lineno"> 1732</span>&#160;<span class="keyword">    </span>{</div>
<div class="line"><a name="l01733"></a><span class="lineno"> 1733</span>&#160;      <span class="keywordtype">int</span> depth = pointNode-&gt;depth();</div>
<div class="line"><a name="l01734"></a><span class="lineno"> 1734</span>&#160;      <span class="keywordflow">if</span>( !depth || pointNode-&gt;nodeData.pointIndex==-1 ) <span class="keywordflow">return</span> Real(0.);</div>
<div class="line"><a name="l01735"></a><span class="lineno"> 1735</span>&#160;      <span class="keywordtype">double</span> pointValue = 0;</div>
<div class="line"><a name="l01736"></a><span class="lineno"> 1736</span>&#160; </div>
<div class="line"><a name="l01737"></a><span class="lineno"> 1737</span>&#160;      Real weight       = _points[ pointNode-&gt;nodeData.pointIndex ].weight;</div>
<div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>&#160;      <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> p = _points[ pointNode-&gt;nodeData.pointIndex ].position;</div>
<div class="line"><a name="l01739"></a><span class="lineno"> 1739</span>&#160; </div>
<div class="line"><a name="l01740"></a><span class="lineno"> 1740</span>&#160;      <span class="comment">// Iterate over all basis functions that overlap the point at the coarser resolutions</span></div>
<div class="line"><a name="l01741"></a><span class="lineno"> 1741</span>&#160;      {</div>
<div class="line"><a name="l01742"></a><span class="lineno"> 1742</span>&#160;        <span class="keywordtype">int</span> d , _idx[3];</div>
<div class="line"><a name="l01743"></a><span class="lineno"> 1743</span>&#160;        <span class="keyword">const</span> TreeOctNode::Neighbors3&amp; neighbors = neighborKey.neighbors[depth-1];</div>
<div class="line"><a name="l01744"></a><span class="lineno"> 1744</span>&#160;        neighbors.neighbors[1][1][1]-&gt;depthAndOffset( d , _idx );</div>
<div class="line"><a name="l01745"></a><span class="lineno"> 1745</span>&#160;        _idx[0] = BinaryNode&lt; double &gt;::CenterIndex( d , _idx[0]-1 );</div>
<div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>&#160;        _idx[1] = BinaryNode&lt; double &gt;::CenterIndex( d , _idx[1]-1 );</div>
<div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>&#160;        _idx[2] = BinaryNode&lt; double &gt;::CenterIndex( d , _idx[2]-1 );</div>
<div class="line"><a name="l01748"></a><span class="lineno"> 1748</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=0 ; j&lt;3 ; j++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> k=0 ; k&lt;3 ; k++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> l=0 ; l&lt;3 ; l++ )</div>
<div class="line"><a name="l01749"></a><span class="lineno"> 1749</span>&#160;          <span class="keywordflow">if</span>( neighbors.neighbors[j][k][l] &amp;&amp; neighbors.neighbors[j][k][l]-&gt;nodeData.nodeIndex&gt;=0 )</div>
<div class="line"><a name="l01750"></a><span class="lineno"> 1750</span>&#160;          {</div>
<div class="line"><a name="l01751"></a><span class="lineno"> 1751</span>&#160;            <span class="comment">// Accumulate the contribution from these basis nodes</span></div>
<div class="line"><a name="l01752"></a><span class="lineno"> 1752</span>&#160;            <span class="keyword">const</span> TreeOctNode* basisNode = neighbors.neighbors[j][k][l];</div>
<div class="line"><a name="l01753"></a><span class="lineno"> 1753</span>&#160;            <span class="keywordtype">int</span> idx[] = { _idx[0]+j , _idx[1]+k , _idx[2]+l };</div>
<div class="line"><a name="l01754"></a><span class="lineno"> 1754</span>&#160;            pointValue +=</div>
<div class="line"><a name="l01755"></a><span class="lineno"> 1755</span>&#160;                fData.baseBSplines[ idx[0] ][2-j]( p[0] ) *</div>
<div class="line"><a name="l01756"></a><span class="lineno"> 1756</span>&#160;                fData.baseBSplines[ idx[1] ][2-k]( p[1] ) *</div>
<div class="line"><a name="l01757"></a><span class="lineno"> 1757</span>&#160;                fData.baseBSplines[ idx[2] ][2-l]( p[2] ) *</div>
<div class="line"><a name="l01758"></a><span class="lineno"> 1758</span>&#160;                metSolution[basisNode-&gt;nodeData.nodeIndex];</div>
<div class="line"><a name="l01759"></a><span class="lineno"> 1759</span>&#160;          }</div>
<div class="line"><a name="l01760"></a><span class="lineno"> 1760</span>&#160;      }</div>
<div class="line"><a name="l01761"></a><span class="lineno"> 1761</span>&#160;      <span class="keywordflow">return</span> Real( pointValue * weight );</div>
<div class="line"><a name="l01762"></a><span class="lineno"> 1762</span>&#160;    }</div>
<div class="line"><a name="l01763"></a><span class="lineno"> 1763</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>&#160;    <span class="keywordtype">int</span> Octree&lt;Degree&gt;::GetFixedDepthLaplacian( SparseSymmetricMatrix&lt; Real &gt;&amp; matrix , <span class="keywordtype">int</span> depth , <span class="keyword">const</span> SortedTreeNodes&amp; sNodes , Real* metSolution )</div>
<div class="line"><a name="l01765"></a><span class="lineno"> 1765</span>&#160;    {</div>
<div class="line"><a name="l01766"></a><span class="lineno"> 1766</span>&#160;      <span class="keywordtype">int</span> start = sNodes.nodeCount[depth] , end = sNodes.nodeCount[depth+1] , range = end-start;</div>
<div class="line"><a name="l01767"></a><span class="lineno"> 1767</span>&#160;      <span class="keywordtype">double</span> stencil[5][5][5];</div>
<div class="line"><a name="l01768"></a><span class="lineno"> 1768</span>&#160;      SetLaplacianStencil( depth , stencil );</div>
<div class="line"><a name="l01769"></a><span class="lineno"> 1769</span>&#160;      Stencil&lt; double , 5 &gt; stencils[2][2][2];</div>
<div class="line"><a name="l01770"></a><span class="lineno"> 1770</span>&#160;      SetLaplacianStencils( depth , stencils );</div>
<div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>&#160;      matrix.Resize( range );</div>
<div class="line"><a name="l01772"></a><span class="lineno"> 1772</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l01773"></a><span class="lineno"> 1773</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ )</div>
<div class="line"><a name="l01774"></a><span class="lineno"> 1774</span>&#160;      {</div>
<div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>&#160;        TreeOctNode::NeighborKey5 neighborKey5;</div>
<div class="line"><a name="l01776"></a><span class="lineno"> 1776</span>&#160;        neighborKey5.set( depth );</div>
<div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=(range*t)/threads ; i&lt;(range*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l01778"></a><span class="lineno"> 1778</span>&#160;        {</div>
<div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>&#160;          TreeOctNode* node = sNodes.treeNodes[i+start];</div>
<div class="line"><a name="l01780"></a><span class="lineno"> 1780</span>&#160;          neighborKey5.getNeighbors( node );</div>
<div class="line"><a name="l01781"></a><span class="lineno"> 1781</span>&#160; </div>
<div class="line"><a name="l01782"></a><span class="lineno"> 1782</span>&#160;          <span class="comment">// Get the matrix row size</span></div>
<div class="line"><a name="l01783"></a><span class="lineno"> 1783</span>&#160;          <span class="keywordtype">int</span> count = GetMatrixRowSize( neighborKey5.neighbors[depth] );</div>
<div class="line"><a name="l01784"></a><span class="lineno"> 1784</span>&#160; </div>
<div class="line"><a name="l01785"></a><span class="lineno"> 1785</span>&#160;          <span class="comment">// Allocate memory for the row</span></div>
<div class="line"><a name="l01786"></a><span class="lineno"> 1786</span>&#160;<span class="preprocessor">#pragma omp critical (matrix_set_row_size)</span></div>
<div class="line"><a name="l01787"></a><span class="lineno"> 1787</span>&#160;          {</div>
<div class="line"><a name="l01788"></a><span class="lineno"> 1788</span>&#160;            matrix.SetRowSize( i , count );</div>
<div class="line"><a name="l01789"></a><span class="lineno"> 1789</span>&#160;          }</div>
<div class="line"><a name="l01790"></a><span class="lineno"> 1790</span>&#160; </div>
<div class="line"><a name="l01791"></a><span class="lineno"> 1791</span>&#160;          <span class="comment">// Set the row entries</span></div>
<div class="line"><a name="l01792"></a><span class="lineno"> 1792</span>&#160;          matrix.rowSizes[i] = SetMatrixRow( neighborKey5.neighbors[depth] , matrix[i] , start , stencil );</div>
<div class="line"><a name="l01793"></a><span class="lineno"> 1793</span>&#160; </div>
<div class="line"><a name="l01794"></a><span class="lineno"> 1794</span>&#160;          <span class="comment">// Offset the constraints using the solution from lower resolutions.</span></div>
<div class="line"><a name="l01795"></a><span class="lineno"> 1795</span>&#160;          <span class="keywordtype">int</span> x , y , z , c;</div>
<div class="line"><a name="l01796"></a><span class="lineno"> 1796</span>&#160;          <span class="keywordflow">if</span>( node-&gt;parent )</div>
<div class="line"><a name="l01797"></a><span class="lineno"> 1797</span>&#160;          {</div>
<div class="line"><a name="l01798"></a><span class="lineno"> 1798</span>&#160;            c = int( node - node-&gt;parent-&gt;children );</div>
<div class="line"><a name="l01799"></a><span class="lineno"> 1799</span>&#160;            Cube::FactorCornerIndex( c , x , y , z );</div>
<div class="line"><a name="l01800"></a><span class="lineno"> 1800</span>&#160;          }</div>
<div class="line"><a name="l01801"></a><span class="lineno"> 1801</span>&#160;          <span class="keywordflow">else</span> x = y = z = 0;</div>
<div class="line"><a name="l01802"></a><span class="lineno"> 1802</span>&#160;          UpdateConstraintsFromCoarser( neighborKey5 , node , metSolution , stencils[x][y][z] );</div>
<div class="line"><a name="l01803"></a><span class="lineno"> 1803</span>&#160;        }</div>
<div class="line"><a name="l01804"></a><span class="lineno"> 1804</span>&#160;      }</div>
<div class="line"><a name="l01805"></a><span class="lineno"> 1805</span>&#160;      <span class="keywordflow">return</span> 1;</div>
<div class="line"><a name="l01806"></a><span class="lineno"> 1806</span>&#160;    }</div>
<div class="line"><a name="l01807"></a><span class="lineno"> 1807</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l01808"></a><span class="lineno"> 1808</span>&#160;    <span class="keywordtype">int</span> Octree&lt;Degree&gt;::GetRestrictedFixedDepthLaplacian( SparseSymmetricMatrix&lt; Real &gt;&amp; matrix,<span class="keywordtype">int</span> depth,<span class="keyword">const</span> <span class="keywordtype">int</span>* entries,<span class="keywordtype">int</span> entryCount,</div>
<div class="line"><a name="l01809"></a><span class="lineno"> 1809</span>&#160;                                                          <span class="keyword">const</span> TreeOctNode* rNode , Real radius ,</div>
<div class="line"><a name="l01810"></a><span class="lineno"> 1810</span>&#160;                                                          <span class="keyword">const</span> SortedTreeNodes&amp; sNodes , Real* metSolution )</div>
<div class="line"><a name="l01811"></a><span class="lineno"> 1811</span>&#160;    {</div>
<div class="line"><a name="l01812"></a><span class="lineno"> 1812</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;entryCount ; i++ ) sNodes.treeNodes[ entries[i] ]-&gt;nodeData.nodeIndex = i;</div>
<div class="line"><a name="l01813"></a><span class="lineno"> 1813</span>&#160;      <span class="keywordtype">double</span> stencil[5][5][5];</div>
<div class="line"><a name="l01814"></a><span class="lineno"> 1814</span>&#160;      <span class="keywordtype">int</span> rDepth , rOff[3];</div>
<div class="line"><a name="l01815"></a><span class="lineno"> 1815</span>&#160;      rNode-&gt;depthAndOffset( rDepth , rOff );</div>
<div class="line"><a name="l01816"></a><span class="lineno"> 1816</span>&#160;      matrix.Resize( entryCount );</div>
<div class="line"><a name="l01817"></a><span class="lineno"> 1817</span>&#160;      SetLaplacianStencil( depth , stencil );</div>
<div class="line"><a name="l01818"></a><span class="lineno"> 1818</span>&#160;      Stencil&lt; double , 5 &gt; stencils[2][2][2];</div>
<div class="line"><a name="l01819"></a><span class="lineno"> 1819</span>&#160;      SetLaplacianStencils( depth , stencils );</div>
<div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l01821"></a><span class="lineno"> 1821</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ )</div>
<div class="line"><a name="l01822"></a><span class="lineno"> 1822</span>&#160;      {</div>
<div class="line"><a name="l01823"></a><span class="lineno"> 1823</span>&#160;        TreeOctNode::NeighborKey5 neighborKey5;</div>
<div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>&#160;        neighborKey5.set( depth );</div>
<div class="line"><a name="l01825"></a><span class="lineno"> 1825</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=(entryCount*t)/threads ; i&lt;(entryCount*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l01826"></a><span class="lineno"> 1826</span>&#160;        {</div>
<div class="line"><a name="l01827"></a><span class="lineno"> 1827</span>&#160;          TreeOctNode* node = sNodes.treeNodes[ entries[i] ];</div>
<div class="line"><a name="l01828"></a><span class="lineno"> 1828</span>&#160;          <span class="keywordtype">int</span> d , off[3];</div>
<div class="line"><a name="l01829"></a><span class="lineno"> 1829</span>&#160;          node-&gt;depthAndOffset( d , off );</div>
<div class="line"><a name="l01830"></a><span class="lineno"> 1830</span>&#160;          off[0] &gt;&gt;= (depth-rDepth) , off[1] &gt;&gt;= (depth-rDepth) , off[2] &gt;&gt;= (depth-rDepth);</div>
<div class="line"><a name="l01831"></a><span class="lineno"> 1831</span>&#160;          <span class="keywordtype">bool</span> isInterior = ( off[0]==rOff[0] &amp;&amp; off[1]==rOff[1] &amp;&amp; off[2]==rOff[2] );</div>
<div class="line"><a name="l01832"></a><span class="lineno"> 1832</span>&#160; </div>
<div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>&#160;          neighborKey5.getNeighbors( node );</div>
<div class="line"><a name="l01834"></a><span class="lineno"> 1834</span>&#160; </div>
<div class="line"><a name="l01835"></a><span class="lineno"> 1835</span>&#160;          <span class="keywordtype">int</span> xStart=0 , xEnd=5 , yStart=0 , yEnd=5 , zStart=0 , zEnd=5;</div>
<div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>&#160;          <span class="keywordflow">if</span>( !isInterior ) SetMatrixRowBounds( neighborKey5.neighbors[depth].neighbors[2][2][2] , rDepth , rOff , xStart , xEnd , yStart , yEnd , zStart , zEnd );</div>
<div class="line"><a name="l01837"></a><span class="lineno"> 1837</span>&#160; </div>
<div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>&#160;          <span class="comment">// Get the matrix row size</span></div>
<div class="line"><a name="l01839"></a><span class="lineno"> 1839</span>&#160;          <span class="keywordtype">int</span> count = GetMatrixRowSize( neighborKey5.neighbors[depth] , xStart , xEnd , yStart , yEnd , zStart , zEnd );</div>
<div class="line"><a name="l01840"></a><span class="lineno"> 1840</span>&#160; </div>
<div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>&#160;          <span class="comment">// Allocate memory for the row</span></div>
<div class="line"><a name="l01842"></a><span class="lineno"> 1842</span>&#160;<span class="preprocessor">#pragma omp critical (matrix_set_row_size)</span></div>
<div class="line"><a name="l01843"></a><span class="lineno"> 1843</span>&#160;          {</div>
<div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>&#160;            matrix.SetRowSize( i , count );</div>
<div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>&#160;          }</div>
<div class="line"><a name="l01846"></a><span class="lineno"> 1846</span>&#160; </div>
<div class="line"><a name="l01847"></a><span class="lineno"> 1847</span>&#160;          <span class="comment">// Set the matrix row entries</span></div>
<div class="line"><a name="l01848"></a><span class="lineno"> 1848</span>&#160;          matrix.rowSizes[i] = SetMatrixRow( neighborKey5.neighbors[depth] , matrix[i] , 0 , stencil , xStart , xEnd , yStart , yEnd , zStart , zEnd );</div>
<div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>&#160;          <span class="comment">// Adjust the system constraints</span></div>
<div class="line"><a name="l01850"></a><span class="lineno"> 1850</span>&#160;          <span class="keywordtype">int</span> x , y , z , c;</div>
<div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>&#160;          <span class="keywordflow">if</span>( node-&gt;parent )</div>
<div class="line"><a name="l01852"></a><span class="lineno"> 1852</span>&#160;          {</div>
<div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>&#160;            c = int( node - node-&gt;parent-&gt;children );</div>
<div class="line"><a name="l01854"></a><span class="lineno"> 1854</span>&#160;            Cube::FactorCornerIndex( c , x , y , z );</div>
<div class="line"><a name="l01855"></a><span class="lineno"> 1855</span>&#160;          }</div>
<div class="line"><a name="l01856"></a><span class="lineno"> 1856</span>&#160;          <span class="keywordflow">else</span> x = y = z = 0;</div>
<div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>&#160;          UpdateConstraintsFromCoarser( neighborKey5 , node , metSolution , stencils[x][y][z] );</div>
<div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>&#160;        }</div>
<div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>&#160;      }</div>
<div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;entryCount ; i++ ) sNodes.treeNodes[entries[i]]-&gt;nodeData.nodeIndex = entries[i];</div>
<div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>&#160;      <span class="keywordflow">return</span> 1;</div>
<div class="line"><a name="l01862"></a><span class="lineno"> 1862</span>&#160;    }</div>
<div class="line"><a name="l01863"></a><span class="lineno"> 1863</span>&#160; </div>
<div class="line"><a name="l01864"></a><span class="lineno"> 1864</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l01865"></a><span class="lineno"> 1865</span>&#160;    <span class="keywordtype">int</span> Octree&lt;Degree&gt;::LaplacianMatrixIteration( <span class="keywordtype">int</span> subdivideDepth , <span class="keywordtype">bool</span> showResidual , <span class="keywordtype">int</span> minIters , <span class="keywordtype">double</span> accuracy )</div>
<div class="line"><a name="l01866"></a><span class="lineno"> 1866</span>&#160;    {</div>
<div class="line"><a name="l01867"></a><span class="lineno"> 1867</span>&#160;      <span class="keywordtype">int</span> i,iter=0;</div>
<div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>&#160;      <span class="keywordtype">double</span> t = 0;</div>
<div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>&#160;      fData.setDotTables( fData.DD_DOT_FLAG | fData.DV_DOT_FLAG );</div>
<div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>&#160; </div>
<div class="line"><a name="l01871"></a><span class="lineno"> 1871</span>&#160;      SparseMatrix&lt; float &gt;::SetAllocator( MEMORY_ALLOCATOR_BLOCK_SIZE );</div>
<div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>&#160;      _sNodes.treeNodes[0]-&gt;nodeData.solution = 0;</div>
<div class="line"><a name="l01873"></a><span class="lineno"> 1873</span>&#160; </div>
<div class="line"><a name="l01874"></a><span class="lineno"> 1874</span>&#160;      std::vector&lt; Real &gt; metSolution( _sNodes.nodeCount[ _sNodes.maxDepth ] , 0 );</div>
<div class="line"><a name="l01875"></a><span class="lineno"> 1875</span>&#160; </div>
<div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>&#160;      <span class="keywordflow">for</span>( i=1 ; i&lt;_sNodes.maxDepth ; i++ )</div>
<div class="line"><a name="l01877"></a><span class="lineno"> 1877</span>&#160;      {</div>
<div class="line"><a name="l01878"></a><span class="lineno"> 1878</span>&#160;        <span class="keywordflow">if</span>( subdivideDepth&gt;0 ) iter += SolveFixedDepthMatrix( i , _sNodes , &amp;metSolution[0] , subdivideDepth , showResidual , minIters , accuracy );</div>
<div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>&#160;        <span class="keywordflow">else</span>                   iter += SolveFixedDepthMatrix( i , _sNodes , &amp;metSolution[0] ,                  showResidual , minIters , accuracy );</div>
<div class="line"><a name="l01880"></a><span class="lineno"> 1880</span>&#160;      }</div>
<div class="line"><a name="l01881"></a><span class="lineno"> 1881</span>&#160;      SparseMatrix&lt; float &gt;::internalAllocator.reset();</div>
<div class="line"><a name="l01882"></a><span class="lineno"> 1882</span>&#160;      fData.clearDotTables( fData.VV_DOT_FLAG | fData.DV_DOT_FLAG | fData.DD_DOT_FLAG );</div>
<div class="line"><a name="l01883"></a><span class="lineno"> 1883</span>&#160; </div>
<div class="line"><a name="l01884"></a><span class="lineno"> 1884</span>&#160;      <span class="keywordflow">return</span> iter;</div>
<div class="line"><a name="l01885"></a><span class="lineno"> 1885</span>&#160;    }</div>
<div class="line"><a name="l01886"></a><span class="lineno"> 1886</span>&#160; </div>
<div class="line"><a name="l01887"></a><span class="lineno"> 1887</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l01888"></a><span class="lineno"> 1888</span>&#160;    <span class="keywordtype">int</span> Octree&lt;Degree&gt;::SolveFixedDepthMatrix( <span class="keywordtype">int</span> depth , <span class="keyword">const</span> SortedTreeNodes&amp; sNodes , Real* metSolution , <span class="keywordtype">bool</span> showResidual , <span class="keywordtype">int</span> minIters , <span class="keywordtype">double</span> accuracy )</div>
<div class="line"><a name="l01889"></a><span class="lineno"> 1889</span>&#160;    {</div>
<div class="line"><a name="l01890"></a><span class="lineno"> 1890</span>&#160;      <span class="keywordtype">int</span> iter = 0;</div>
<div class="line"><a name="l01891"></a><span class="lineno"> 1891</span>&#160;      Vector&lt; Real &gt; X , B;</div>
<div class="line"><a name="l01892"></a><span class="lineno"> 1892</span>&#160;      SparseSymmetricMatrix&lt; Real &gt; M;</div>
<div class="line"><a name="l01893"></a><span class="lineno"> 1893</span>&#160;      <span class="keywordtype">double</span> systemTime=0. , solveTime=0. , updateTime=0. ,  evaluateTime = 0.;</div>
<div class="line"><a name="l01894"></a><span class="lineno"> 1894</span>&#160; </div>
<div class="line"><a name="l01895"></a><span class="lineno"> 1895</span>&#160;      X.Resize( sNodes.nodeCount[depth+1]-sNodes.nodeCount[depth] );</div>
<div class="line"><a name="l01896"></a><span class="lineno"> 1896</span>&#160;      <span class="keywordflow">if</span>( depth&lt;=_minDepth ) UpSampleCoarserSolution( depth , sNodes , X );</div>
<div class="line"><a name="l01897"></a><span class="lineno"> 1897</span>&#160;      <span class="keywordflow">else</span></div>
<div class="line"><a name="l01898"></a><span class="lineno"> 1898</span>&#160;      {</div>
<div class="line"><a name="l01899"></a><span class="lineno"> 1899</span>&#160;        <span class="comment">// Up-sample the cumulative solution into the previous depth</span></div>
<div class="line"><a name="l01900"></a><span class="lineno"> 1900</span>&#160;        UpSample( depth-1 , sNodes , metSolution );</div>
<div class="line"><a name="l01901"></a><span class="lineno"> 1901</span>&#160;        <span class="comment">// Add in the solution from that depth</span></div>
<div class="line"><a name="l01902"></a><span class="lineno"> 1902</span>&#160;        <span class="keywordflow">if</span>( depth )</div>
<div class="line"><a name="l01903"></a><span class="lineno"> 1903</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=_sNodes.nodeCount[depth-1] ; i&lt;_sNodes.nodeCount[depth] ; i++ ) metSolution[i] += _sNodes.treeNodes[i]-&gt;nodeData.solution;</div>
<div class="line"><a name="l01905"></a><span class="lineno"> 1905</span>&#160;      }</div>
<div class="line"><a name="l01906"></a><span class="lineno"> 1906</span>&#160;      <span class="keywordflow">if</span>( _constrainValues )</div>
<div class="line"><a name="l01907"></a><span class="lineno"> 1907</span>&#160;      {</div>
<div class="line"><a name="l01908"></a><span class="lineno"> 1908</span>&#160;        SetCoarserPointValues( depth , sNodes , metSolution );</div>
<div class="line"><a name="l01909"></a><span class="lineno"> 1909</span>&#160;      }</div>
<div class="line"><a name="l01910"></a><span class="lineno"> 1910</span>&#160; </div>
<div class="line"><a name="l01911"></a><span class="lineno"> 1911</span>&#160;      SparseSymmetricMatrix&lt; Real &gt;::internalAllocator.rollBack();</div>
<div class="line"><a name="l01912"></a><span class="lineno"> 1912</span>&#160;      {</div>
<div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>&#160;        <span class="keywordtype">int</span> maxECount = ( (2*Degree+1)*(2*Degree+1)*(2*Degree+1) + 1 ) / 2;</div>
<div class="line"><a name="l01914"></a><span class="lineno"> 1914</span>&#160;        maxECount = ( ( maxECount + 15 ) / 16 ) * 16;</div>
<div class="line"><a name="l01915"></a><span class="lineno"> 1915</span>&#160;        M.Resize( sNodes.nodeCount[depth+1]-sNodes.nodeCount[depth] );</div>
<div class="line"><a name="l01916"></a><span class="lineno"> 1916</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;M.rows ; i++ ) M.SetRowSize( i , maxECount );</div>
<div class="line"><a name="l01917"></a><span class="lineno"> 1917</span>&#160;      }</div>
<div class="line"><a name="l01918"></a><span class="lineno"> 1918</span>&#160; </div>
<div class="line"><a name="l01919"></a><span class="lineno"> 1919</span>&#160;      {</div>
<div class="line"><a name="l01920"></a><span class="lineno"> 1920</span>&#160;        <span class="comment">// Get the system matrix</span></div>
<div class="line"><a name="l01921"></a><span class="lineno"> 1921</span>&#160;        SparseSymmetricMatrix&lt; Real &gt;::internalAllocator.rollBack();</div>
<div class="line"><a name="l01922"></a><span class="lineno"> 1922</span>&#160;        GetFixedDepthLaplacian( M , depth , sNodes , metSolution );</div>
<div class="line"><a name="l01923"></a><span class="lineno"> 1923</span>&#160;        <span class="comment">// Set the constraint vector</span></div>
<div class="line"><a name="l01924"></a><span class="lineno"> 1924</span>&#160;        B.Resize( sNodes.nodeCount[depth+1]-sNodes.nodeCount[depth] );</div>
<div class="line"><a name="l01925"></a><span class="lineno"> 1925</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=sNodes.nodeCount[depth] ; i&lt;sNodes.nodeCount[depth+1] ; i++ ) B[i-sNodes.nodeCount[depth]] = sNodes.treeNodes[i]-&gt;nodeData.constraint;</div>
<div class="line"><a name="l01926"></a><span class="lineno"> 1926</span>&#160;      }</div>
<div class="line"><a name="l01927"></a><span class="lineno"> 1927</span>&#160; </div>
<div class="line"><a name="l01928"></a><span class="lineno"> 1928</span>&#160;      <span class="comment">// Solve the linear system</span></div>
<div class="line"><a name="l01929"></a><span class="lineno"> 1929</span>&#160;      iter += SparseSymmetricMatrix&lt; Real &gt;::Solve( M , B , std::max&lt; int &gt;( <span class="keywordtype">int</span>( pow( M.rows , ITERATION_POWER ) ) , minIters ) , X , Real(accuracy) , 0 , threads , (depth&lt;=_minDepth) &amp;&amp; !_constrainValues );</div>
<div class="line"><a name="l01930"></a><span class="lineno"> 1930</span>&#160; </div>
<div class="line"><a name="l01931"></a><span class="lineno"> 1931</span>&#160;      <span class="keywordflow">if</span>( showResidual )</div>
<div class="line"><a name="l01932"></a><span class="lineno"> 1932</span>&#160;      {</div>
<div class="line"><a name="l01933"></a><span class="lineno"> 1933</span>&#160;        <span class="keywordtype">double</span> mNorm = 0;</div>
<div class="line"><a name="l01934"></a><span class="lineno"> 1934</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;M.rows ; i++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=0 ; j&lt;M.rowSizes[i] ; j++ ) mNorm += M[i][j].Value * M[i][j].Value;</div>
<div class="line"><a name="l01935"></a><span class="lineno"> 1935</span>&#160;        <span class="keywordtype">double</span> bNorm = B.Norm( 2 ) , rNorm = ( B - M * X ).Norm( 2 );</div>
<div class="line"><a name="l01936"></a><span class="lineno"> 1936</span>&#160;        printf( <span class="stringliteral">&quot;\tResidual: (%d %g) %g -&gt; %g (%f) [%d]\n&quot;</span> , M.Entries() , sqrt(mNorm) , bNorm , rNorm , rNorm/bNorm , iter );</div>
<div class="line"><a name="l01937"></a><span class="lineno"> 1937</span>&#160;      }</div>
<div class="line"><a name="l01938"></a><span class="lineno"> 1938</span>&#160; </div>
<div class="line"><a name="l01939"></a><span class="lineno"> 1939</span>&#160;      <span class="comment">// Copy the solution back into the tree (over-writing the constraints)</span></div>
<div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=sNodes.nodeCount[depth] ; i&lt;sNodes.nodeCount[depth+1] ; i++ ) sNodes.treeNodes[i]-&gt;nodeData.solution = Real( X[i-sNodes.nodeCount[depth]] );</div>
<div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>&#160; </div>
<div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>&#160;      <span class="keywordflow">return</span> iter;</div>
<div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>&#160;    }</div>
<div class="line"><a name="l01944"></a><span class="lineno"> 1944</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l01945"></a><span class="lineno"> 1945</span>&#160;    <span class="keywordtype">int</span> Octree&lt;Degree&gt;::SolveFixedDepthMatrix( <span class="keywordtype">int</span> depth , <span class="keyword">const</span> SortedTreeNodes&amp; sNodes , Real* metSolution , <span class="keywordtype">int</span> startingDepth , <span class="keywordtype">bool</span> showResidual , <span class="keywordtype">int</span> minIters , <span class="keywordtype">double</span> accuracy )</div>
<div class="line"><a name="l01946"></a><span class="lineno"> 1946</span>&#160;    {</div>
<div class="line"><a name="l01947"></a><span class="lineno"> 1947</span>&#160;      <span class="keywordflow">if</span>( startingDepth&gt;=depth ) <span class="keywordflow">return</span> SolveFixedDepthMatrix( depth , sNodes , metSolution , showResidual , minIters , accuracy );</div>
<div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>&#160; </div>
<div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>&#160;      <span class="keywordtype">int</span> i , j , d , tIter=0;</div>
<div class="line"><a name="l01950"></a><span class="lineno"> 1950</span>&#160;      SparseSymmetricMatrix&lt; Real &gt; _M;</div>
<div class="line"><a name="l01951"></a><span class="lineno"> 1951</span>&#160;      Vector&lt; Real &gt; B , B_ , X_;</div>
<div class="line"><a name="l01952"></a><span class="lineno"> 1952</span>&#160;      AdjacencySetFunction asf;</div>
<div class="line"><a name="l01953"></a><span class="lineno"> 1953</span>&#160;      AdjacencyCountFunction acf;</div>
<div class="line"><a name="l01954"></a><span class="lineno"> 1954</span>&#160;      <span class="keywordtype">double</span> systemTime = 0 , solveTime = 0 , memUsage = 0 , evaluateTime = 0 , gTime = 0, sTime = 0;</div>
<div class="line"><a name="l01955"></a><span class="lineno"> 1955</span>&#160;      Real myRadius , myRadius2;</div>
<div class="line"><a name="l01956"></a><span class="lineno"> 1956</span>&#160; </div>
<div class="line"><a name="l01957"></a><span class="lineno"> 1957</span>&#160;      <span class="keywordflow">if</span>( depth&gt;_minDepth )</div>
<div class="line"><a name="l01958"></a><span class="lineno"> 1958</span>&#160;      {</div>
<div class="line"><a name="l01959"></a><span class="lineno"> 1959</span>&#160;        <span class="comment">// Up-sample the cumulative solution into the previous depth</span></div>
<div class="line"><a name="l01960"></a><span class="lineno"> 1960</span>&#160;        UpSample( depth-1 , sNodes , metSolution );</div>
<div class="line"><a name="l01961"></a><span class="lineno"> 1961</span>&#160;        <span class="comment">// Add in the solution from that depth</span></div>
<div class="line"><a name="l01962"></a><span class="lineno"> 1962</span>&#160;        <span class="keywordflow">if</span>( depth )</div>
<div class="line"><a name="l01963"></a><span class="lineno"> 1963</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l01964"></a><span class="lineno"> 1964</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=_sNodes.nodeCount[depth-1] ; i&lt;_sNodes.nodeCount[depth] ; i++ ) metSolution[i] += _sNodes.treeNodes[i]-&gt;nodeData.solution;</div>
<div class="line"><a name="l01965"></a><span class="lineno"> 1965</span>&#160;      }</div>
<div class="line"><a name="l01966"></a><span class="lineno"> 1966</span>&#160; </div>
<div class="line"><a name="l01967"></a><span class="lineno"> 1967</span>&#160;      <span class="keywordflow">if</span>( _constrainValues )</div>
<div class="line"><a name="l01968"></a><span class="lineno"> 1968</span>&#160;      {</div>
<div class="line"><a name="l01969"></a><span class="lineno"> 1969</span>&#160;        SetCoarserPointValues( depth , sNodes , metSolution );</div>
<div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>&#160;      }</div>
<div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>&#160;      B.Resize( sNodes.nodeCount[depth+1] - sNodes.nodeCount[depth] );</div>
<div class="line"><a name="l01972"></a><span class="lineno"> 1972</span>&#160; </div>
<div class="line"><a name="l01973"></a><span class="lineno"> 1973</span>&#160;      <span class="comment">// Back-up the constraints</span></div>
<div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>&#160;      <span class="keywordflow">for</span>( i=sNodes.nodeCount[depth] ; i&lt;sNodes.nodeCount[depth+1] ; i++ )</div>
<div class="line"><a name="l01975"></a><span class="lineno"> 1975</span>&#160;      {</div>
<div class="line"><a name="l01976"></a><span class="lineno"> 1976</span>&#160;        B[ i-sNodes.nodeCount[depth] ] = sNodes.treeNodes[i]-&gt;nodeData.constraint;</div>
<div class="line"><a name="l01977"></a><span class="lineno"> 1977</span>&#160;        sNodes.treeNodes[i]-&gt;nodeData.constraint = 0;</div>
<div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>&#160;      }</div>
<div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>&#160; </div>
<div class="line"><a name="l01980"></a><span class="lineno"> 1980</span>&#160;      myRadius = 2*radius-Real(0.5);</div>
<div class="line"><a name="l01981"></a><span class="lineno"> 1981</span>&#160;      myRadius = int(myRadius-ROUND_EPS)+ROUND_EPS;</div>
<div class="line"><a name="l01982"></a><span class="lineno"> 1982</span>&#160;      myRadius2 = Real(radius+ROUND_EPS-0.5);</div>
<div class="line"><a name="l01983"></a><span class="lineno"> 1983</span>&#160;      d = depth-startingDepth;</div>
<div class="line"><a name="l01984"></a><span class="lineno"> 1984</span>&#160;      std::vector&lt; int &gt; subDimension( sNodes.nodeCount[d+1]-sNodes.nodeCount[d] );</div>
<div class="line"><a name="l01985"></a><span class="lineno"> 1985</span>&#160;      <span class="keywordtype">int</span> maxDimension = 0;</div>
<div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>&#160;      <span class="keywordflow">for</span>( i=sNodes.nodeCount[d] ; i&lt;sNodes.nodeCount[d+1] ; i++ )</div>
<div class="line"><a name="l01987"></a><span class="lineno"> 1987</span>&#160;      {</div>
<div class="line"><a name="l01988"></a><span class="lineno"> 1988</span>&#160;        <span class="comment">// Count the number of nodes at depth &quot;depth&quot; that lie under sNodes.treeNodes[i]</span></div>
<div class="line"><a name="l01989"></a><span class="lineno"> 1989</span>&#160;        acf.adjacencyCount = 0;</div>
<div class="line"><a name="l01990"></a><span class="lineno"> 1990</span>&#160;        <span class="keywordflow">for</span>( TreeOctNode* temp=sNodes.treeNodes[i]-&gt;nextNode() ; temp ; )</div>
<div class="line"><a name="l01991"></a><span class="lineno"> 1991</span>&#160;        {</div>
<div class="line"><a name="l01992"></a><span class="lineno"> 1992</span>&#160;          <span class="keywordflow">if</span>( temp-&gt;depth()==depth ) acf.adjacencyCount++ , temp = sNodes.treeNodes[i]-&gt;nextBranch( temp );</div>
<div class="line"><a name="l01993"></a><span class="lineno"> 1993</span>&#160;          <span class="keywordflow">else</span>                                              temp = sNodes.treeNodes[i]-&gt;nextNode  ( temp );</div>
<div class="line"><a name="l01994"></a><span class="lineno"> 1994</span>&#160;        }</div>
<div class="line"><a name="l01995"></a><span class="lineno"> 1995</span>&#160;        <span class="keywordflow">for</span>( j=sNodes.nodeCount[d] ; j&lt;sNodes.nodeCount[d+1] ; j++ )</div>
<div class="line"><a name="l01996"></a><span class="lineno"> 1996</span>&#160;        {</div>
<div class="line"><a name="l01997"></a><span class="lineno"> 1997</span>&#160;          <span class="keywordflow">if</span>( i==j ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l01998"></a><span class="lineno"> 1998</span>&#160;          TreeOctNode::ProcessFixedDepthNodeAdjacentNodes( fData.depth , sNodes.treeNodes[i] , 1 , sNodes.treeNodes[j] , 2*width-1 , depth , &amp;acf );</div>
<div class="line"><a name="l01999"></a><span class="lineno"> 1999</span>&#160;        }</div>
<div class="line"><a name="l02000"></a><span class="lineno"> 2000</span>&#160;        subDimension[i-sNodes.nodeCount[d]] = acf.adjacencyCount;</div>
<div class="line"><a name="l02001"></a><span class="lineno"> 2001</span>&#160;        maxDimension = std::max&lt; int &gt;( maxDimension , subDimension[i-sNodes.nodeCount[d]] );</div>
<div class="line"><a name="l02002"></a><span class="lineno"> 2002</span>&#160;      }</div>
<div class="line"><a name="l02003"></a><span class="lineno"> 2003</span>&#160;      asf.adjacencies = <span class="keyword">new</span> <span class="keywordtype">int</span>[maxDimension];</div>
<div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>&#160;      MapReduceVector&lt; Real &gt; mrVector;</div>
<div class="line"><a name="l02005"></a><span class="lineno"> 2005</span>&#160;      mrVector.resize( threads , maxDimension );</div>
<div class="line"><a name="l02006"></a><span class="lineno"> 2006</span>&#160;      <span class="comment">// Iterate through the coarse-level nodes</span></div>
<div class="line"><a name="l02007"></a><span class="lineno"> 2007</span>&#160;      <span class="keywordflow">for</span>( i=sNodes.nodeCount[d] ; i&lt;sNodes.nodeCount[d+1] ; i++ )</div>
<div class="line"><a name="l02008"></a><span class="lineno"> 2008</span>&#160;      {</div>
<div class="line"><a name="l02009"></a><span class="lineno"> 2009</span>&#160;        <span class="keywordtype">int</span> iter = 0;</div>
<div class="line"><a name="l02010"></a><span class="lineno"> 2010</span>&#160;        <span class="comment">// Count the number of nodes at depth &quot;depth&quot; that lie under sNodes.treeNodes[i]</span></div>
<div class="line"><a name="l02011"></a><span class="lineno"> 2011</span>&#160;        acf.adjacencyCount = subDimension[i-sNodes.nodeCount[d]];</div>
<div class="line"><a name="l02012"></a><span class="lineno"> 2012</span>&#160;        <span class="keywordflow">if</span>( !acf.adjacencyCount ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l02013"></a><span class="lineno"> 2013</span>&#160; </div>
<div class="line"><a name="l02014"></a><span class="lineno"> 2014</span>&#160;        <span class="comment">// Set the indices for the nodes under, or near, sNodes.treeNodes[i].</span></div>
<div class="line"><a name="l02015"></a><span class="lineno"> 2015</span>&#160;        asf.adjacencyCount = 0;</div>
<div class="line"><a name="l02016"></a><span class="lineno"> 2016</span>&#160;        <span class="keywordflow">for</span>( TreeOctNode* temp=sNodes.treeNodes[i]-&gt;nextNode() ; temp ; )</div>
<div class="line"><a name="l02017"></a><span class="lineno"> 2017</span>&#160;        {</div>
<div class="line"><a name="l02018"></a><span class="lineno"> 2018</span>&#160;          <span class="keywordflow">if</span>( temp-&gt;depth()==depth ) asf.adjacencies[ asf.adjacencyCount++ ] = temp-&gt;nodeData.nodeIndex , temp = sNodes.treeNodes[i]-&gt;nextBranch( temp );</div>
<div class="line"><a name="l02019"></a><span class="lineno"> 2019</span>&#160;          <span class="keywordflow">else</span>                                                                                            temp = sNodes.treeNodes[i]-&gt;nextNode  ( temp );</div>
<div class="line"><a name="l02020"></a><span class="lineno"> 2020</span>&#160;        }</div>
<div class="line"><a name="l02021"></a><span class="lineno"> 2021</span>&#160;        <span class="keywordflow">for</span>( j=sNodes.nodeCount[d] ; j&lt;sNodes.nodeCount[d+1] ; j++ )</div>
<div class="line"><a name="l02022"></a><span class="lineno"> 2022</span>&#160;        {</div>
<div class="line"><a name="l02023"></a><span class="lineno"> 2023</span>&#160;          <span class="keywordflow">if</span>( i==j ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l02024"></a><span class="lineno"> 2024</span>&#160;          TreeOctNode::ProcessFixedDepthNodeAdjacentNodes( fData.depth , sNodes.treeNodes[i] , 1 , sNodes.treeNodes[j] , 2*width-1 , depth , &amp;asf );</div>
<div class="line"><a name="l02025"></a><span class="lineno"> 2025</span>&#160;        }</div>
<div class="line"><a name="l02026"></a><span class="lineno"> 2026</span>&#160; </div>
<div class="line"><a name="l02027"></a><span class="lineno"> 2027</span>&#160;        <span class="comment">// Get the associated constraint vector</span></div>
<div class="line"><a name="l02028"></a><span class="lineno"> 2028</span>&#160;        B_.Resize( asf.adjacencyCount );</div>
<div class="line"><a name="l02029"></a><span class="lineno"> 2029</span>&#160;        <span class="keywordflow">for</span>( j=0 ; j&lt;asf.adjacencyCount ; j++ ) B_[j] = B[ asf.adjacencies[j]-sNodes.nodeCount[depth] ];</div>
<div class="line"><a name="l02030"></a><span class="lineno"> 2030</span>&#160; </div>
<div class="line"><a name="l02031"></a><span class="lineno"> 2031</span>&#160;        X_.Resize( asf.adjacencyCount );</div>
<div class="line"><a name="l02032"></a><span class="lineno"> 2032</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads ) schedule( static )</span></div>
<div class="line"><a name="l02033"></a><span class="lineno"> 2033</span>&#160;        <span class="keywordflow">for</span>( j=0 ; j&lt;asf.adjacencyCount ; j++ )</div>
<div class="line"><a name="l02034"></a><span class="lineno"> 2034</span>&#160;        {</div>
<div class="line"><a name="l02035"></a><span class="lineno"> 2035</span>&#160;          X_[j] = sNodes.treeNodes[ asf.adjacencies[j] ]-&gt;nodeData.solution;</div>
<div class="line"><a name="l02036"></a><span class="lineno"> 2036</span>&#160;        }</div>
<div class="line"><a name="l02037"></a><span class="lineno"> 2037</span>&#160;        <span class="comment">// Get the associated matrix</span></div>
<div class="line"><a name="l02038"></a><span class="lineno"> 2038</span>&#160;        SparseSymmetricMatrix&lt; Real &gt;::internalAllocator.rollBack();</div>
<div class="line"><a name="l02039"></a><span class="lineno"> 2039</span>&#160;        GetRestrictedFixedDepthLaplacian( _M , depth , asf.adjacencies , asf.adjacencyCount , sNodes.treeNodes[i] , myRadius , sNodes , metSolution );</div>
<div class="line"><a name="l02040"></a><span class="lineno"> 2040</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads ) schedule( static )</span></div>
<div class="line"><a name="l02041"></a><span class="lineno"> 2041</span>&#160;        <span class="keywordflow">for</span>( j=0 ; j&lt;asf.adjacencyCount ; j++ )</div>
<div class="line"><a name="l02042"></a><span class="lineno"> 2042</span>&#160;        {</div>
<div class="line"><a name="l02043"></a><span class="lineno"> 2043</span>&#160;          B_[j] += sNodes.treeNodes[asf.adjacencies[j]]-&gt;nodeData.constraint;</div>
<div class="line"><a name="l02044"></a><span class="lineno"> 2044</span>&#160;          sNodes.treeNodes[ asf.adjacencies[j] ]-&gt;nodeData.constraint = 0;</div>
<div class="line"><a name="l02045"></a><span class="lineno"> 2045</span>&#160;        }</div>
<div class="line"><a name="l02046"></a><span class="lineno"> 2046</span>&#160; </div>
<div class="line"><a name="l02047"></a><span class="lineno"> 2047</span>&#160;        <span class="comment">// Solve the matrix</span></div>
<div class="line"><a name="l02048"></a><span class="lineno"> 2048</span>&#160;        <span class="comment">// Since we don&#39;t have the full matrix, the system shouldn&#39;t be singular, so we shouldn&#39;t have to correct it</span></div>
<div class="line"><a name="l02049"></a><span class="lineno"> 2049</span>&#160;        iter += SparseSymmetricMatrix&lt; Real &gt;::Solve( _M , B_ , std::max&lt; int &gt;( <span class="keywordtype">int</span>( pow( _M.rows , ITERATION_POWER ) ) , minIters ) , X_ , mrVector , Real(accuracy) , 0 );</div>
<div class="line"><a name="l02050"></a><span class="lineno"> 2050</span>&#160; </div>
<div class="line"><a name="l02051"></a><span class="lineno"> 2051</span>&#160;        <span class="keywordflow">if</span>( showResidual )</div>
<div class="line"><a name="l02052"></a><span class="lineno"> 2052</span>&#160;        {</div>
<div class="line"><a name="l02053"></a><span class="lineno"> 2053</span>&#160;          <span class="keywordtype">double</span> mNorm = 0;</div>
<div class="line"><a name="l02054"></a><span class="lineno"> 2054</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;_M.rows ; i++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=0 ; j&lt;_M.rowSizes[i] ; j++ ) mNorm += _M[i][j].Value * _M[i][j].Value;</div>
<div class="line"><a name="l02055"></a><span class="lineno"> 2055</span>&#160;          <span class="keywordtype">double</span> bNorm = B_.Norm( 2 ) , rNorm = ( B_ - _M * X_ ).Norm( 2 );</div>
<div class="line"><a name="l02056"></a><span class="lineno"> 2056</span>&#160;          printf( <span class="stringliteral">&quot;\t\tResidual: (%d %g) %g -&gt; %g (%f) [%d]\n&quot;</span> , _M.Entries() , sqrt(mNorm) , bNorm , rNorm , rNorm/bNorm , iter );</div>
<div class="line"><a name="l02057"></a><span class="lineno"> 2057</span>&#160;        }</div>
<div class="line"><a name="l02058"></a><span class="lineno"> 2058</span>&#160; </div>
<div class="line"><a name="l02059"></a><span class="lineno"> 2059</span>&#160;        <span class="comment">// Update the solution for all nodes in the sub-tree</span></div>
<div class="line"><a name="l02060"></a><span class="lineno"> 2060</span>&#160;        <span class="keywordflow">for</span>( j=0 ; j&lt;asf.adjacencyCount ; j++ )</div>
<div class="line"><a name="l02061"></a><span class="lineno"> 2061</span>&#160;        {</div>
<div class="line"><a name="l02062"></a><span class="lineno"> 2062</span>&#160;          TreeOctNode* temp=sNodes.treeNodes[ asf.adjacencies[j] ];</div>
<div class="line"><a name="l02063"></a><span class="lineno"> 2063</span>&#160;          <span class="keywordflow">while</span>( temp-&gt;depth()&gt;sNodes.treeNodes[i]-&gt;depth() ) temp=temp-&gt;parent;</div>
<div class="line"><a name="l02064"></a><span class="lineno"> 2064</span>&#160;          <span class="keywordflow">if</span>( temp-&gt;nodeData.nodeIndex&gt;=sNodes.treeNodes[i]-&gt;nodeData.nodeIndex ) sNodes.treeNodes[ asf.adjacencies[j] ]-&gt;nodeData.solution = Real( X_[j] );</div>
<div class="line"><a name="l02065"></a><span class="lineno"> 2065</span>&#160;        }</div>
<div class="line"><a name="l02066"></a><span class="lineno"> 2066</span>&#160;        systemTime += gTime;</div>
<div class="line"><a name="l02067"></a><span class="lineno"> 2067</span>&#160;        solveTime += sTime;</div>
<div class="line"><a name="l02068"></a><span class="lineno"> 2068</span>&#160;        memUsage = std::max&lt; double &gt;( MemoryUsage() , memUsage );</div>
<div class="line"><a name="l02069"></a><span class="lineno"> 2069</span>&#160;        tIter += iter;</div>
<div class="line"><a name="l02070"></a><span class="lineno"> 2070</span>&#160;      }</div>
<div class="line"><a name="l02071"></a><span class="lineno"> 2071</span>&#160;      <span class="keyword">delete</span>[] asf.adjacencies;</div>
<div class="line"><a name="l02072"></a><span class="lineno"> 2072</span>&#160;      <span class="keywordflow">return</span> tIter;</div>
<div class="line"><a name="l02073"></a><span class="lineno"> 2073</span>&#160;    }</div>
<div class="line"><a name="l02074"></a><span class="lineno"> 2074</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l02075"></a><span class="lineno"> 2075</span>&#160;    <span class="keywordtype">int</span> Octree&lt;Degree&gt;::HasNormals(TreeOctNode* node,Real epsilon)</div>
<div class="line"><a name="l02076"></a><span class="lineno"> 2076</span>&#160;    {</div>
<div class="line"><a name="l02077"></a><span class="lineno"> 2077</span>&#160;      <span class="keywordtype">int</span> hasNormals=0;</div>
<div class="line"><a name="l02078"></a><span class="lineno"> 2078</span>&#160;      <span class="keywordflow">if</span>( node-&gt;nodeData.normalIndex&gt;=0 &amp;&amp; ( (*normals)[node-&gt;nodeData.normalIndex][0]!=0 || (*normals)[node-&gt;nodeData.normalIndex][1]!=0 || (*normals)[node-&gt;nodeData.normalIndex][2]!=0 ) ) hasNormals=1;</div>
<div class="line"><a name="l02079"></a><span class="lineno"> 2079</span>&#160;      <span class="keywordflow">if</span>( node-&gt;children ) <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;Cube::CORNERS &amp;&amp; !hasNormals;i++) hasNormals |= HasNormals(&amp;node-&gt;children[i],epsilon);</div>
<div class="line"><a name="l02080"></a><span class="lineno"> 2080</span>&#160; </div>
<div class="line"><a name="l02081"></a><span class="lineno"> 2081</span>&#160;      <span class="keywordflow">return</span> hasNormals;</div>
<div class="line"><a name="l02082"></a><span class="lineno"> 2082</span>&#160;    }</div>
<div class="line"><a name="l02083"></a><span class="lineno"> 2083</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l02084"></a><span class="lineno"> 2084</span>&#160;    <span class="keywordtype">void</span> Octree&lt;Degree&gt;::ClipTree( <span class="keywordtype">void</span> )</div>
<div class="line"><a name="l02085"></a><span class="lineno"> 2085</span>&#160;    {</div>
<div class="line"><a name="l02086"></a><span class="lineno"> 2086</span>&#160;      <span class="keywordtype">int</span> maxDepth = tree.maxDepth();</div>
<div class="line"><a name="l02087"></a><span class="lineno"> 2087</span>&#160;      <span class="keywordflow">for</span>( TreeOctNode* temp=tree.nextNode() ; temp ; temp=tree.nextNode(temp) )</div>
<div class="line"><a name="l02088"></a><span class="lineno"> 2088</span>&#160;        <span class="keywordflow">if</span>( temp-&gt;children &amp;&amp; temp-&gt;d&gt;=_minDepth )</div>
<div class="line"><a name="l02089"></a><span class="lineno"> 2089</span>&#160;        {</div>
<div class="line"><a name="l02090"></a><span class="lineno"> 2090</span>&#160;          <span class="keywordtype">int</span> hasNormals=0;</div>
<div class="line"><a name="l02091"></a><span class="lineno"> 2091</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;Cube::CORNERS &amp;&amp; !hasNormals ; i++ ) hasNormals = HasNormals( &amp;temp-&gt;children[i] , EPSILON/(1&lt;&lt;maxDepth) );</div>
<div class="line"><a name="l02092"></a><span class="lineno"> 2092</span>&#160;          <span class="keywordflow">if</span>( !hasNormals ) temp-&gt;children=NULL;</div>
<div class="line"><a name="l02093"></a><span class="lineno"> 2093</span>&#160;        }</div>
<div class="line"><a name="l02094"></a><span class="lineno"> 2094</span>&#160;      MemoryUsage();</div>
<div class="line"><a name="l02095"></a><span class="lineno"> 2095</span>&#160;    }</div>
<div class="line"><a name="l02096"></a><span class="lineno"> 2096</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l02097"></a><span class="lineno"> 2097</span>&#160;    <span class="keywordtype">void</span> Octree&lt;Degree&gt;::SetLaplacianConstraints( <span class="keywordtype">void</span> )</div>
<div class="line"><a name="l02098"></a><span class="lineno"> 2098</span>&#160;    {</div>
<div class="line"><a name="l02099"></a><span class="lineno"> 2099</span>&#160;      <span class="comment">// To set the Laplacian constraints, we iterate over the</span></div>
<div class="line"><a name="l02100"></a><span class="lineno"> 2100</span>&#160;      <span class="comment">// splatted normals and compute the dot-product of the</span></div>
<div class="line"><a name="l02101"></a><span class="lineno"> 2101</span>&#160;      <span class="comment">// divergence of the normal field with all the basis functions.</span></div>
<div class="line"><a name="l02102"></a><span class="lineno"> 2102</span>&#160;      <span class="comment">// Within the same depth: set directly as a gather</span></div>
<div class="line"><a name="l02103"></a><span class="lineno"> 2103</span>&#160;      <span class="comment">// Coarser depths</span></div>
<div class="line"><a name="l02104"></a><span class="lineno"> 2104</span>&#160;      fData.setDotTables( fData.VV_DOT_FLAG | fData.DV_DOT_FLAG );</div>
<div class="line"><a name="l02105"></a><span class="lineno"> 2105</span>&#160; </div>
<div class="line"><a name="l02106"></a><span class="lineno"> 2106</span>&#160;      <span class="keywordtype">int</span> maxDepth = _sNodes.maxDepth-1;</div>
<div class="line"><a name="l02107"></a><span class="lineno"> 2107</span>&#160;      <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> zeroPoint;</div>
<div class="line"><a name="l02108"></a><span class="lineno"> 2108</span>&#160;      zeroPoint[0] = zeroPoint[1] = zeroPoint[2] = 0;</div>
<div class="line"><a name="l02109"></a><span class="lineno"> 2109</span>&#160;      std::vector&lt; Real &gt; constraints( _sNodes.nodeCount[maxDepth] , Real(0) );</div>
<div class="line"><a name="l02110"></a><span class="lineno"> 2110</span>&#160;      std::vector&lt; Point3D&lt; Real &gt; &gt; coefficients( _sNodes.nodeCount[maxDepth] , zeroPoint );</div>
<div class="line"><a name="l02111"></a><span class="lineno"> 2111</span>&#160; </div>
<div class="line"><a name="l02112"></a><span class="lineno"> 2112</span>&#160;      <span class="comment">// Clear the constraints</span></div>
<div class="line"><a name="l02113"></a><span class="lineno"> 2113</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l02114"></a><span class="lineno"> 2114</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;_sNodes.nodeCount[maxDepth+1] ; i++ ) _sNodes.treeNodes[i]-&gt;nodeData.constraint = Real( 0. );</div>
<div class="line"><a name="l02115"></a><span class="lineno"> 2115</span>&#160; </div>
<div class="line"><a name="l02116"></a><span class="lineno"> 2116</span>&#160;      <span class="comment">// For the scattering part of the operation, we parallelize by duplicating the constraints and then summing at the end.</span></div>
<div class="line"><a name="l02117"></a><span class="lineno"> 2117</span>&#160;      std::vector&lt; std::vector&lt; Real &gt; &gt; _constraints( threads );</div>
<div class="line"><a name="l02118"></a><span class="lineno"> 2118</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ ) _constraints[t].resize( _sNodes.nodeCount[maxDepth] , 0 );</div>
<div class="line"><a name="l02119"></a><span class="lineno"> 2119</span>&#160; </div>
<div class="line"><a name="l02120"></a><span class="lineno"> 2120</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=maxDepth ; d&gt;=0 ; d-- )</div>
<div class="line"><a name="l02121"></a><span class="lineno"> 2121</span>&#160;      {</div>
<div class="line"><a name="l02122"></a><span class="lineno"> 2122</span>&#160;        <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; double &gt;</a> stencil[5][5][5];</div>
<div class="line"><a name="l02123"></a><span class="lineno"> 2123</span>&#160;        SetDivergenceStencil( d , &amp;stencil[0][0][0] , <span class="keyword">false</span> );</div>
<div class="line"><a name="l02124"></a><span class="lineno"> 2124</span>&#160;        Stencil&lt; Point3D&lt; double &gt; , 5 &gt; stencils[2][2][2];</div>
<div class="line"><a name="l02125"></a><span class="lineno"> 2125</span>&#160;        SetDivergenceStencils( d , stencils , <span class="keyword">true</span> );</div>
<div class="line"><a name="l02126"></a><span class="lineno"> 2126</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l02127"></a><span class="lineno"> 2127</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ )</div>
<div class="line"><a name="l02128"></a><span class="lineno"> 2128</span>&#160;        {</div>
<div class="line"><a name="l02129"></a><span class="lineno"> 2129</span>&#160;          TreeOctNode::NeighborKey5 neighborKey5;</div>
<div class="line"><a name="l02130"></a><span class="lineno"> 2130</span>&#160;          neighborKey5.set( fData.depth );</div>
<div class="line"><a name="l02131"></a><span class="lineno"> 2131</span>&#160;          <span class="keywordtype">int</span> start = _sNodes.nodeCount[d] , end = _sNodes.nodeCount[d+1] , range = end-start;</div>
<div class="line"><a name="l02132"></a><span class="lineno"> 2132</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=start+(range*t)/threads ; i&lt;start+(range*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l02133"></a><span class="lineno"> 2133</span>&#160;          {</div>
<div class="line"><a name="l02134"></a><span class="lineno"> 2134</span>&#160;            TreeOctNode* node = _sNodes.treeNodes[i];</div>
<div class="line"><a name="l02135"></a><span class="lineno"> 2135</span>&#160;            <span class="keywordtype">int</span> startX=0 , endX=5 , startY=0 , endY=5 , startZ=0 , endZ=5;</div>
<div class="line"><a name="l02136"></a><span class="lineno"> 2136</span>&#160;            <span class="keywordtype">int</span> depth = node-&gt;depth();</div>
<div class="line"><a name="l02137"></a><span class="lineno"> 2137</span>&#160;            neighborKey5.getNeighbors( node );</div>
<div class="line"><a name="l02138"></a><span class="lineno"> 2138</span>&#160; </div>
<div class="line"><a name="l02139"></a><span class="lineno"> 2139</span>&#160;            <span class="keywordtype">bool</span> isInterior , isInterior2;</div>
<div class="line"><a name="l02140"></a><span class="lineno"> 2140</span>&#160;            {</div>
<div class="line"><a name="l02141"></a><span class="lineno"> 2141</span>&#160;              <span class="keywordtype">int</span> d , off[3];</div>
<div class="line"><a name="l02142"></a><span class="lineno"> 2142</span>&#160;              node-&gt;depthAndOffset( d , off );</div>
<div class="line"><a name="l02143"></a><span class="lineno"> 2143</span>&#160;              <span class="keywordtype">int</span> mn = 2 , mx = (1&lt;&lt;d)-2;</div>
<div class="line"><a name="l02144"></a><span class="lineno"> 2144</span>&#160;              isInterior = ( off[0]&gt;=mn &amp;&amp; off[0]&lt;mx &amp;&amp; off[1]&gt;=mn &amp;&amp; off[1]&lt;mx &amp;&amp; off[2]&gt;=mn &amp;&amp; off[2]&lt;mx );</div>
<div class="line"><a name="l02145"></a><span class="lineno"> 2145</span>&#160;              mn += 2 , mx -= 2;</div>
<div class="line"><a name="l02146"></a><span class="lineno"> 2146</span>&#160;              isInterior2 = ( off[0]&gt;=mn &amp;&amp; off[0]&lt;mx &amp;&amp; off[1]&gt;=mn &amp;&amp; off[1]&lt;mx &amp;&amp; off[2]&gt;=mn &amp;&amp; off[2]&lt;mx );</div>
<div class="line"><a name="l02147"></a><span class="lineno"> 2147</span>&#160;            }</div>
<div class="line"><a name="l02148"></a><span class="lineno"> 2148</span>&#160;            <span class="keywordtype">int</span> cx , cy , cz;</div>
<div class="line"><a name="l02149"></a><span class="lineno"> 2149</span>&#160;            <span class="keywordflow">if</span>( d )</div>
<div class="line"><a name="l02150"></a><span class="lineno"> 2150</span>&#160;            {</div>
<div class="line"><a name="l02151"></a><span class="lineno"> 2151</span>&#160;              <span class="keywordtype">int</span> c = int( node - node-&gt;parent-&gt;children );</div>
<div class="line"><a name="l02152"></a><span class="lineno"> 2152</span>&#160;              Cube::FactorCornerIndex( c , cx , cy , cz );</div>
<div class="line"><a name="l02153"></a><span class="lineno"> 2153</span>&#160;            }</div>
<div class="line"><a name="l02154"></a><span class="lineno"> 2154</span>&#160;            <span class="keywordflow">else</span> cx = cy = cz = 0;</div>
<div class="line"><a name="l02155"></a><span class="lineno"> 2155</span>&#160;            Stencil&lt; Point3D&lt; double &gt; , 5 &gt;&amp; _stencil = stencils[cx][cy][cz];</div>
<div class="line"><a name="l02156"></a><span class="lineno"> 2156</span>&#160; </div>
<div class="line"><a name="l02157"></a><span class="lineno"> 2157</span>&#160;            <span class="comment">// Set constraints from current depth</span></div>
<div class="line"><a name="l02158"></a><span class="lineno"> 2158</span>&#160;            {</div>
<div class="line"><a name="l02159"></a><span class="lineno"> 2159</span>&#160;              <span class="keyword">const</span> TreeOctNode::Neighbors5&amp; neighbors5 = neighborKey5.neighbors[depth];</div>
<div class="line"><a name="l02160"></a><span class="lineno"> 2160</span>&#160; </div>
<div class="line"><a name="l02161"></a><span class="lineno"> 2161</span>&#160;              <span class="keywordflow">if</span>( isInterior )</div>
<div class="line"><a name="l02162"></a><span class="lineno"> 2162</span>&#160;                <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=startX ; x&lt;endX ; x++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=startY ; y&lt;endY ; y++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=startZ ; z&lt;endZ ; z++ )</div>
<div class="line"><a name="l02163"></a><span class="lineno"> 2163</span>&#160;                {</div>
<div class="line"><a name="l02164"></a><span class="lineno"> 2164</span>&#160;                  <span class="keyword">const</span> TreeOctNode* _node = neighbors5.neighbors[x][y][z];</div>
<div class="line"><a name="l02165"></a><span class="lineno"> 2165</span>&#160;                  <span class="keywordflow">if</span>( _node &amp;&amp; _node-&gt;nodeData.normalIndex&gt;=0 )</div>
<div class="line"><a name="l02166"></a><span class="lineno"> 2166</span>&#160;                  {</div>
<div class="line"><a name="l02167"></a><span class="lineno"> 2167</span>&#160;                    <span class="keyword">const</span> <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a>&amp; _normal = (*normals)[_node-&gt;nodeData.normalIndex];</div>
<div class="line"><a name="l02168"></a><span class="lineno"> 2168</span>&#160;                    node-&gt;nodeData.constraint += Real( stencil[x][y][z][0] * _normal[0] + stencil[x][y][z][1] * _normal[1] + stencil[x][y][z][2] * _normal[2] );</div>
<div class="line"><a name="l02169"></a><span class="lineno"> 2169</span>&#160;                  }</div>
<div class="line"><a name="l02170"></a><span class="lineno"> 2170</span>&#160;                }</div>
<div class="line"><a name="l02171"></a><span class="lineno"> 2171</span>&#160;              <span class="keywordflow">else</span></div>
<div class="line"><a name="l02172"></a><span class="lineno"> 2172</span>&#160;                <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=startX ; x&lt;endX ; x++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=startY ; y&lt;endY ; y++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=startZ ; z&lt;endZ ; z++ )</div>
<div class="line"><a name="l02173"></a><span class="lineno"> 2173</span>&#160;                {</div>
<div class="line"><a name="l02174"></a><span class="lineno"> 2174</span>&#160;                  <span class="keyword">const</span> TreeOctNode* _node = neighbors5.neighbors[x][y][z];</div>
<div class="line"><a name="l02175"></a><span class="lineno"> 2175</span>&#160;                  <span class="keywordflow">if</span>( _node &amp;&amp; _node-&gt;nodeData.normalIndex&gt;=0 )</div>
<div class="line"><a name="l02176"></a><span class="lineno"> 2176</span>&#160;                  {</div>
<div class="line"><a name="l02177"></a><span class="lineno"> 2177</span>&#160;                    <span class="keyword">const</span> <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a>&amp; _normal = (*normals)[_node-&gt;nodeData.normalIndex];</div>
<div class="line"><a name="l02178"></a><span class="lineno"> 2178</span>&#160;                    node-&gt;nodeData.constraint += GetDivergence( _node , node ,  _normal );</div>
<div class="line"><a name="l02179"></a><span class="lineno"> 2179</span>&#160;                  }</div>
<div class="line"><a name="l02180"></a><span class="lineno"> 2180</span>&#160;                }</div>
<div class="line"><a name="l02181"></a><span class="lineno"> 2181</span>&#160;              UpdateCoarserSupportBounds( neighbors5.neighbors[2][2][2] , startX , endX , startY  , endY , startZ , endZ );</div>
<div class="line"><a name="l02182"></a><span class="lineno"> 2182</span>&#160;            }</div>
<div class="line"><a name="l02183"></a><span class="lineno"> 2183</span>&#160;            <span class="keywordflow">if</span>( node-&gt;nodeData.nodeIndex&lt;0 || node-&gt;nodeData.normalIndex&lt;0 ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l02184"></a><span class="lineno"> 2184</span>&#160;            <span class="keyword">const</span> <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a>&amp; normal = (*normals)[node-&gt;nodeData.normalIndex];</div>
<div class="line"><a name="l02185"></a><span class="lineno"> 2185</span>&#160;            <span class="keywordflow">if</span>( normal[0]==0 &amp;&amp; normal[1]==0 &amp;&amp; normal[2]==0 ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l02186"></a><span class="lineno"> 2186</span>&#160;            <span class="keywordflow">if</span>( depth&lt;maxDepth ) coefficients[i] += normal;</div>
<div class="line"><a name="l02187"></a><span class="lineno"> 2187</span>&#160; </div>
<div class="line"><a name="l02188"></a><span class="lineno"> 2188</span>&#160;            <span class="keywordflow">if</span>( depth )</div>
<div class="line"><a name="l02189"></a><span class="lineno"> 2189</span>&#160;            {</div>
<div class="line"><a name="l02190"></a><span class="lineno"> 2190</span>&#160;              <span class="keyword">const</span> TreeOctNode::Neighbors5&amp; neighbors5 = neighborKey5.neighbors[depth-1];</div>
<div class="line"><a name="l02191"></a><span class="lineno"> 2191</span>&#160; </div>
<div class="line"><a name="l02192"></a><span class="lineno"> 2192</span>&#160;              <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=startX ; x&lt;endX ; x++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=startY ; y&lt;endY ; y++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=startZ ; z&lt;endZ ; z++ )</div>
<div class="line"><a name="l02193"></a><span class="lineno"> 2193</span>&#160;                <span class="keywordflow">if</span>( neighbors5.neighbors[x][y][z] )</div>
<div class="line"><a name="l02194"></a><span class="lineno"> 2194</span>&#160;                {</div>
<div class="line"><a name="l02195"></a><span class="lineno"> 2195</span>&#160;                  TreeOctNode* _node = neighbors5.neighbors[x][y][z];</div>
<div class="line"><a name="l02196"></a><span class="lineno"> 2196</span>&#160;                  <span class="keywordflow">if</span>( isInterior2 )</div>
<div class="line"><a name="l02197"></a><span class="lineno"> 2197</span>&#160;                  {</div>
<div class="line"><a name="l02198"></a><span class="lineno"> 2198</span>&#160;                    <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; double &gt;</a>&amp; div = _stencil.values[x][y][z];</div>
<div class="line"><a name="l02199"></a><span class="lineno"> 2199</span>&#160;                    _constraints[t][ _node-&gt;nodeData.nodeIndex ] += Real( div[0] * normal[0] + div[1] * normal[1] + div[2] * normal[2] );</div>
<div class="line"><a name="l02200"></a><span class="lineno"> 2200</span>&#160;                  }</div>
<div class="line"><a name="l02201"></a><span class="lineno"> 2201</span>&#160;                  <span class="keywordflow">else</span> _constraints[t][ _node-&gt;nodeData.nodeIndex ] += GetDivergence( node , _node , normal );</div>
<div class="line"><a name="l02202"></a><span class="lineno"> 2202</span>&#160;                }</div>
<div class="line"><a name="l02203"></a><span class="lineno"> 2203</span>&#160;            }</div>
<div class="line"><a name="l02204"></a><span class="lineno"> 2204</span>&#160;          }</div>
<div class="line"><a name="l02205"></a><span class="lineno"> 2205</span>&#160;        }</div>
<div class="line"><a name="l02206"></a><span class="lineno"> 2206</span>&#160;      }</div>
<div class="line"><a name="l02207"></a><span class="lineno"> 2207</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads ) schedule( static )</span></div>
<div class="line"><a name="l02208"></a><span class="lineno"> 2208</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;_sNodes.nodeCount[maxDepth] ; i++ )</div>
<div class="line"><a name="l02209"></a><span class="lineno"> 2209</span>&#160;      {</div>
<div class="line"><a name="l02210"></a><span class="lineno"> 2210</span>&#160;        Real cSum = Real(0.);</div>
<div class="line"><a name="l02211"></a><span class="lineno"> 2211</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ ) cSum += _constraints[t][i];</div>
<div class="line"><a name="l02212"></a><span class="lineno"> 2212</span>&#160;        constraints[i] = cSum;</div>
<div class="line"><a name="l02213"></a><span class="lineno"> 2213</span>&#160;      }</div>
<div class="line"><a name="l02214"></a><span class="lineno"> 2214</span>&#160;      <span class="comment">// Fine-to-coarse down-sampling of constraints</span></div>
<div class="line"><a name="l02215"></a><span class="lineno"> 2215</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=maxDepth-1 ; d&gt;=0 ; d-- ) DownSample( d , _sNodes , &amp;constraints[0] );</div>
<div class="line"><a name="l02216"></a><span class="lineno"> 2216</span>&#160; </div>
<div class="line"><a name="l02217"></a><span class="lineno"> 2217</span>&#160;      <span class="comment">// Coarse-to-fine up-sampling of coefficients</span></div>
<div class="line"><a name="l02218"></a><span class="lineno"> 2218</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=0 ; d&lt;maxDepth ; d++ ) UpSample( d , _sNodes , &amp;coefficients[0] );</div>
<div class="line"><a name="l02219"></a><span class="lineno"> 2219</span>&#160; </div>
<div class="line"><a name="l02220"></a><span class="lineno"> 2220</span>&#160;      <span class="comment">// Add the accumulated constraints from all finer depths</span></div>
<div class="line"><a name="l02221"></a><span class="lineno"> 2221</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l02222"></a><span class="lineno"> 2222</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;_sNodes.nodeCount[maxDepth] ; i++ ) _sNodes.treeNodes[i]-&gt;nodeData.constraint += constraints[i];</div>
<div class="line"><a name="l02223"></a><span class="lineno"> 2223</span>&#160; </div>
<div class="line"><a name="l02224"></a><span class="lineno"> 2224</span>&#160;      <span class="comment">// Compute the contribution from all coarser depths</span></div>
<div class="line"><a name="l02225"></a><span class="lineno"> 2225</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=0 ; d&lt;=maxDepth ; d++ )</div>
<div class="line"><a name="l02226"></a><span class="lineno"> 2226</span>&#160;      {</div>
<div class="line"><a name="l02227"></a><span class="lineno"> 2227</span>&#160;        <span class="keywordtype">int</span> start = _sNodes.nodeCount[d] , end = _sNodes.nodeCount[d+1] , range = end - start;</div>
<div class="line"><a name="l02228"></a><span class="lineno"> 2228</span>&#160;        Stencil&lt; Point3D&lt; double &gt; , 5 &gt; stencils[2][2][2];</div>
<div class="line"><a name="l02229"></a><span class="lineno"> 2229</span>&#160;        SetDivergenceStencils( d , stencils , <span class="keyword">false</span> );</div>
<div class="line"><a name="l02230"></a><span class="lineno"> 2230</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l02231"></a><span class="lineno"> 2231</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ )</div>
<div class="line"><a name="l02232"></a><span class="lineno"> 2232</span>&#160;        {</div>
<div class="line"><a name="l02233"></a><span class="lineno"> 2233</span>&#160;          TreeOctNode::NeighborKey5 neighborKey5;</div>
<div class="line"><a name="l02234"></a><span class="lineno"> 2234</span>&#160;          neighborKey5.set( maxDepth );</div>
<div class="line"><a name="l02235"></a><span class="lineno"> 2235</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=start+(range*t)/threads ; i&lt;start+(range*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l02236"></a><span class="lineno"> 2236</span>&#160;          {</div>
<div class="line"><a name="l02237"></a><span class="lineno"> 2237</span>&#160;            TreeOctNode* node = _sNodes.treeNodes[i];</div>
<div class="line"><a name="l02238"></a><span class="lineno"> 2238</span>&#160;            <span class="keywordtype">int</span> depth = node-&gt;depth();</div>
<div class="line"><a name="l02239"></a><span class="lineno"> 2239</span>&#160;            <span class="keywordflow">if</span>( !depth ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l02240"></a><span class="lineno"> 2240</span>&#160;            <span class="keywordtype">int</span> startX=0 , endX=5 , startY=0 , endY=5 , startZ=0 , endZ=5;</div>
<div class="line"><a name="l02241"></a><span class="lineno"> 2241</span>&#160;            UpdateCoarserSupportBounds( node , startX , endX , startY  , endY , startZ , endZ );</div>
<div class="line"><a name="l02242"></a><span class="lineno"> 2242</span>&#160;            <span class="keyword">const</span> TreeOctNode::Neighbors5&amp; neighbors5 = neighborKey5.getNeighbors( node-&gt;parent );</div>
<div class="line"><a name="l02243"></a><span class="lineno"> 2243</span>&#160; </div>
<div class="line"><a name="l02244"></a><span class="lineno"> 2244</span>&#160;            <span class="keywordtype">bool</span> isInterior;</div>
<div class="line"><a name="l02245"></a><span class="lineno"> 2245</span>&#160;            {</div>
<div class="line"><a name="l02246"></a><span class="lineno"> 2246</span>&#160;              <span class="keywordtype">int</span> d , off[3];</div>
<div class="line"><a name="l02247"></a><span class="lineno"> 2247</span>&#160;              node-&gt;depthAndOffset( d , off );</div>
<div class="line"><a name="l02248"></a><span class="lineno"> 2248</span>&#160;              <span class="keywordtype">int</span> mn = 4 , mx = (1&lt;&lt;d)-4;</div>
<div class="line"><a name="l02249"></a><span class="lineno"> 2249</span>&#160;              isInterior = ( off[0]&gt;=mn &amp;&amp; off[0]&lt;mx &amp;&amp; off[1]&gt;=mn &amp;&amp; off[1]&lt;mx &amp;&amp; off[2]&gt;=mn &amp;&amp; off[2]&lt;mx );</div>
<div class="line"><a name="l02250"></a><span class="lineno"> 2250</span>&#160;            }</div>
<div class="line"><a name="l02251"></a><span class="lineno"> 2251</span>&#160;            <span class="keywordtype">int</span> cx , cy , cz;</div>
<div class="line"><a name="l02252"></a><span class="lineno"> 2252</span>&#160;            <span class="keywordflow">if</span>( d )</div>
<div class="line"><a name="l02253"></a><span class="lineno"> 2253</span>&#160;            {</div>
<div class="line"><a name="l02254"></a><span class="lineno"> 2254</span>&#160;              <span class="keywordtype">int</span> c = int( node - node-&gt;parent-&gt;children );</div>
<div class="line"><a name="l02255"></a><span class="lineno"> 2255</span>&#160;              Cube::FactorCornerIndex( c , cx , cy , cz );</div>
<div class="line"><a name="l02256"></a><span class="lineno"> 2256</span>&#160;            }</div>
<div class="line"><a name="l02257"></a><span class="lineno"> 2257</span>&#160;            <span class="keywordflow">else</span> cx = cy = cz = 0;</div>
<div class="line"><a name="l02258"></a><span class="lineno"> 2258</span>&#160;            Stencil&lt; Point3D&lt; double &gt; , 5 &gt;&amp; _stencil = stencils[cx][cy][cz];</div>
<div class="line"><a name="l02259"></a><span class="lineno"> 2259</span>&#160; </div>
<div class="line"><a name="l02260"></a><span class="lineno"> 2260</span>&#160;            Real constraint = Real(0);</div>
<div class="line"><a name="l02261"></a><span class="lineno"> 2261</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=startX ; x&lt;endX ; x++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=startY ; y&lt;endY ; y++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=startZ ; z&lt;endZ ; z++ )</div>
<div class="line"><a name="l02262"></a><span class="lineno"> 2262</span>&#160;              <span class="keywordflow">if</span>( neighbors5.neighbors[x][y][z] )</div>
<div class="line"><a name="l02263"></a><span class="lineno"> 2263</span>&#160;              {</div>
<div class="line"><a name="l02264"></a><span class="lineno"> 2264</span>&#160;                TreeOctNode* _node = neighbors5.neighbors[x][y][z];</div>
<div class="line"><a name="l02265"></a><span class="lineno"> 2265</span>&#160;                <span class="keywordtype">int</span> _i = _node-&gt;nodeData.nodeIndex;</div>
<div class="line"><a name="l02266"></a><span class="lineno"> 2266</span>&#160;                <span class="keywordflow">if</span>( isInterior )</div>
<div class="line"><a name="l02267"></a><span class="lineno"> 2267</span>&#160;                {</div>
<div class="line"><a name="l02268"></a><span class="lineno"> 2268</span>&#160;                  <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; double &gt;</a>&amp; div = _stencil.values[x][y][z];</div>
<div class="line"><a name="l02269"></a><span class="lineno"> 2269</span>&#160;                  <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a>&amp; normal = coefficients[_i];</div>
<div class="line"><a name="l02270"></a><span class="lineno"> 2270</span>&#160;                  constraint += Real( div[0] * normal[0] + div[1] * normal[1] + div[2] * normal[2] );</div>
<div class="line"><a name="l02271"></a><span class="lineno"> 2271</span>&#160;                }</div>
<div class="line"><a name="l02272"></a><span class="lineno"> 2272</span>&#160;                <span class="keywordflow">else</span> constraint += GetDivergence( _node , node , coefficients[_i] );</div>
<div class="line"><a name="l02273"></a><span class="lineno"> 2273</span>&#160;              }</div>
<div class="line"><a name="l02274"></a><span class="lineno"> 2274</span>&#160;            node-&gt;nodeData.constraint += constraint;</div>
<div class="line"><a name="l02275"></a><span class="lineno"> 2275</span>&#160;          }</div>
<div class="line"><a name="l02276"></a><span class="lineno"> 2276</span>&#160;        }</div>
<div class="line"><a name="l02277"></a><span class="lineno"> 2277</span>&#160;      }</div>
<div class="line"><a name="l02278"></a><span class="lineno"> 2278</span>&#160; </div>
<div class="line"><a name="l02279"></a><span class="lineno"> 2279</span>&#160;      fData.clearDotTables( fData.DV_DOT_FLAG );</div>
<div class="line"><a name="l02280"></a><span class="lineno"> 2280</span>&#160; </div>
<div class="line"><a name="l02281"></a><span class="lineno"> 2281</span>&#160;      <span class="comment">// Set the point weights for evaluating the iso-value</span></div>
<div class="line"><a name="l02282"></a><span class="lineno"> 2282</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l02283"></a><span class="lineno"> 2283</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ )</div>
<div class="line"><a name="l02284"></a><span class="lineno"> 2284</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=(_sNodes.nodeCount[maxDepth+1]*t)/threads ; i&lt;(_sNodes.nodeCount[maxDepth+1]*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l02285"></a><span class="lineno"> 2285</span>&#160;        {</div>
<div class="line"><a name="l02286"></a><span class="lineno"> 2286</span>&#160;          TreeOctNode* temp = _sNodes.treeNodes[i];</div>
<div class="line"><a name="l02287"></a><span class="lineno"> 2287</span>&#160;          <span class="keywordflow">if</span>( temp-&gt;nodeData.nodeIndex&lt;0 || temp-&gt;nodeData.normalIndex&lt;0 ) temp-&gt;nodeData.centerWeightContribution = 0;</div>
<div class="line"><a name="l02288"></a><span class="lineno"> 2288</span>&#160;          <span class="keywordflow">else</span>                                                             temp-&gt;nodeData.centerWeightContribution = Real( Length((*normals)[temp-&gt;nodeData.normalIndex]) );</div>
<div class="line"><a name="l02289"></a><span class="lineno"> 2289</span>&#160;        }</div>
<div class="line"><a name="l02290"></a><span class="lineno"> 2290</span>&#160;      MemoryUsage();</div>
<div class="line"><a name="l02291"></a><span class="lineno"> 2291</span>&#160;      <span class="keyword">delete</span> normals;</div>
<div class="line"><a name="l02292"></a><span class="lineno"> 2292</span>&#160;      normals = NULL;</div>
<div class="line"><a name="l02293"></a><span class="lineno"> 2293</span>&#160;    }</div>
<div class="line"><a name="l02294"></a><span class="lineno"> 2294</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l02295"></a><span class="lineno"> 2295</span>&#160;    <span class="keywordtype">void</span> Octree&lt;Degree&gt;::AdjacencyCountFunction::Function(<span class="keyword">const</span> TreeOctNode* node1,<span class="keyword">const</span> TreeOctNode* node2){adjacencyCount++;}</div>
<div class="line"><a name="l02296"></a><span class="lineno"> 2296</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l02297"></a><span class="lineno"> 2297</span>&#160;    <span class="keywordtype">void</span> Octree&lt;Degree&gt;::AdjacencySetFunction::Function(<span class="keyword">const</span> TreeOctNode* node1,<span class="keyword">const</span> TreeOctNode* node2){adjacencies[adjacencyCount++]=node1-&gt;nodeData.nodeIndex;}</div>
<div class="line"><a name="l02298"></a><span class="lineno"> 2298</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l02299"></a><span class="lineno"> 2299</span>&#160;    <span class="keywordtype">void</span> Octree&lt;Degree&gt;::RefineFunction::Function( TreeOctNode* node1 , <span class="keyword">const</span> TreeOctNode* node2 )</div>
<div class="line"><a name="l02300"></a><span class="lineno"> 2300</span>&#160;    {</div>
<div class="line"><a name="l02301"></a><span class="lineno"> 2301</span>&#160;      <span class="keywordflow">if</span>( !node1-&gt;children &amp;&amp; node1-&gt;depth()&lt;depth ) node1-&gt;initChildren();</div>
<div class="line"><a name="l02302"></a><span class="lineno"> 2302</span>&#160;    }</div>
<div class="line"><a name="l02303"></a><span class="lineno"> 2303</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l02304"></a><span class="lineno"> 2304</span>&#160;    <span class="keywordtype">void</span> Octree&lt; Degree &gt;::FaceEdgesFunction::Function( <span class="keyword">const</span> TreeOctNode* node1 , <span class="keyword">const</span> TreeOctNode* node2 )</div>
<div class="line"><a name="l02305"></a><span class="lineno"> 2305</span>&#160;    {</div>
<div class="line"><a name="l02306"></a><span class="lineno"> 2306</span>&#160;      <span class="keywordflow">if</span>( !node1-&gt;children &amp;&amp; MarchingCubes::HasRoots( node1-&gt;nodeData.mcIndex ) )</div>
<div class="line"><a name="l02307"></a><span class="lineno"> 2307</span>&#160;      {</div>
<div class="line"><a name="l02308"></a><span class="lineno"> 2308</span>&#160;        RootInfo ri1 , ri2;</div>
<div class="line"><a name="l02309"></a><span class="lineno"> 2309</span>&#160;        hash_map&lt; long long , std::pair&lt; RootInfo , int &gt; &gt;::iterator iter;</div>
<div class="line"><a name="l02310"></a><span class="lineno"> 2310</span>&#160;        <span class="keywordtype">int</span> isoTri[DIMENSION*MarchingCubes::MAX_TRIANGLES];</div>
<div class="line"><a name="l02311"></a><span class="lineno"> 2311</span>&#160;        <span class="keywordtype">int</span> count=MarchingCubes::AddTriangleIndices( node1-&gt;nodeData.mcIndex , isoTri );</div>
<div class="line"><a name="l02312"></a><span class="lineno"> 2312</span>&#160; </div>
<div class="line"><a name="l02313"></a><span class="lineno"> 2313</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=0 ; j&lt;count ; j++ )</div>
<div class="line"><a name="l02314"></a><span class="lineno"> 2314</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> k=0 ; k&lt;3 ; k++ )</div>
<div class="line"><a name="l02315"></a><span class="lineno"> 2315</span>&#160;            <span class="keywordflow">if</span>( fIndex==Cube::FaceAdjacentToEdges( isoTri[j*3+k] , isoTri[j*3+((k+1)%3)] ) )</div>
<div class="line"><a name="l02316"></a><span class="lineno"> 2316</span>&#160;              <span class="keywordflow">if</span>( GetRootIndex( node1 , isoTri[j*3+k] , maxDepth , ri1 ) &amp;&amp; GetRootIndex( node1 , isoTri[j*3+((k+1)%3)] , maxDepth , ri2 ) )</div>
<div class="line"><a name="l02317"></a><span class="lineno"> 2317</span>&#160;              {</div>
<div class="line"><a name="l02318"></a><span class="lineno"> 2318</span>&#160;                <span class="keywordtype">long</span> <span class="keywordtype">long</span> key1=ri1.key , key2=ri2.key;</div>
<div class="line"><a name="l02319"></a><span class="lineno"> 2319</span>&#160;                edges-&gt;push_back( std::pair&lt; RootInfo , RootInfo &gt;( ri2 , ri1 ) );</div>
<div class="line"><a name="l02320"></a><span class="lineno"> 2320</span>&#160;                iter = vertexCount-&gt;find( key1 );</div>
<div class="line"><a name="l02321"></a><span class="lineno"> 2321</span>&#160;                <span class="keywordflow">if</span>( iter==vertexCount-&gt;end() )</div>
<div class="line"><a name="l02322"></a><span class="lineno"> 2322</span>&#160;                {</div>
<div class="line"><a name="l02323"></a><span class="lineno"> 2323</span>&#160;                  (*vertexCount)[key1].first = ri1;</div>
<div class="line"><a name="l02324"></a><span class="lineno"> 2324</span>&#160;                  (*vertexCount)[key1].second=0;</div>
<div class="line"><a name="l02325"></a><span class="lineno"> 2325</span>&#160;                }</div>
<div class="line"><a name="l02326"></a><span class="lineno"> 2326</span>&#160;                iter=vertexCount-&gt;find(key2);</div>
<div class="line"><a name="l02327"></a><span class="lineno"> 2327</span>&#160;                <span class="keywordflow">if</span>( iter==vertexCount-&gt;end() )</div>
<div class="line"><a name="l02328"></a><span class="lineno"> 2328</span>&#160;                {</div>
<div class="line"><a name="l02329"></a><span class="lineno"> 2329</span>&#160;                  (*vertexCount)[key2].first = ri2;</div>
<div class="line"><a name="l02330"></a><span class="lineno"> 2330</span>&#160;                  (*vertexCount)[key2].second=0;</div>
<div class="line"><a name="l02331"></a><span class="lineno"> 2331</span>&#160;                }</div>
<div class="line"><a name="l02332"></a><span class="lineno"> 2332</span>&#160;                (*vertexCount)[key1].second--;</div>
<div class="line"><a name="l02333"></a><span class="lineno"> 2333</span>&#160;                (*vertexCount)[key2].second++;</div>
<div class="line"><a name="l02334"></a><span class="lineno"> 2334</span>&#160;              }</div>
<div class="line"><a name="l02335"></a><span class="lineno"> 2335</span>&#160;              <span class="keywordflow">else</span> fprintf( stderr , <span class="stringliteral">&quot;Bad Edge 1: %d %d\n&quot;</span> , ri1.key , ri2.key );</div>
<div class="line"><a name="l02336"></a><span class="lineno"> 2336</span>&#160;      }</div>
<div class="line"><a name="l02337"></a><span class="lineno"> 2337</span>&#160;    }</div>
<div class="line"><a name="l02338"></a><span class="lineno"> 2338</span>&#160; </div>
<div class="line"><a name="l02339"></a><span class="lineno"> 2339</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l02340"></a><span class="lineno"> 2340</span>&#160;    <span class="keywordtype">void</span> Octree&lt; Degree &gt;::RefineBoundary( <span class="keywordtype">int</span> subdivideDepth )</div>
<div class="line"><a name="l02341"></a><span class="lineno"> 2341</span>&#160;    {</div>
<div class="line"><a name="l02342"></a><span class="lineno"> 2342</span>&#160;      <span class="comment">// This implementation is somewhat tricky.</span></div>
<div class="line"><a name="l02343"></a><span class="lineno"> 2343</span>&#160;      <span class="comment">// We would like to ensure that leaf-nodes across a subdivision boundary have the same depth.</span></div>
<div class="line"><a name="l02344"></a><span class="lineno"> 2344</span>&#160;      <span class="comment">// We do this by calling the setNeighbors function.</span></div>
<div class="line"><a name="l02345"></a><span class="lineno"> 2345</span>&#160;      <span class="comment">// The key is to implement this in a single pass through the leaves, ensuring that refinements don&#39;t propogate.</span></div>
<div class="line"><a name="l02346"></a><span class="lineno"> 2346</span>&#160;      <span class="comment">// To this end, we do the minimal refinement that ensures that a cross boundary neighbor, and any of its cross-boundary</span></div>
<div class="line"><a name="l02347"></a><span class="lineno"> 2347</span>&#160;      <span class="comment">// neighbors are all refined simultaneously.</span></div>
<div class="line"><a name="l02348"></a><span class="lineno"> 2348</span>&#160;      <span class="comment">// For this reason, the implementation can only support nodes deeper than sDepth.</span></div>
<div class="line"><a name="l02349"></a><span class="lineno"> 2349</span>&#160;      <span class="keywordtype">bool</span> flags[3][3][3];</div>
<div class="line"><a name="l02350"></a><span class="lineno"> 2350</span>&#160;      <span class="keywordtype">int</span> maxDepth = tree.maxDepth();</div>
<div class="line"><a name="l02351"></a><span class="lineno"> 2351</span>&#160; </div>
<div class="line"><a name="l02352"></a><span class="lineno"> 2352</span>&#160;      <span class="keywordtype">int</span> sDepth;</div>
<div class="line"><a name="l02353"></a><span class="lineno"> 2353</span>&#160;      <span class="keywordflow">if</span>( subdivideDepth&lt;=0 ) sDepth = 0;</div>
<div class="line"><a name="l02354"></a><span class="lineno"> 2354</span>&#160;      <span class="keywordflow">else</span>                    sDepth = maxDepth-subdivideDepth;</div>
<div class="line"><a name="l02355"></a><span class="lineno"> 2355</span>&#160;      <span class="keywordflow">if</span>( sDepth&lt;=0 ) <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l02356"></a><span class="lineno"> 2356</span>&#160; </div>
<div class="line"><a name="l02357"></a><span class="lineno"> 2357</span>&#160;      <span class="comment">// Ensure that face adjacent neighbors across the subdivision boundary exist to allow for</span></div>
<div class="line"><a name="l02358"></a><span class="lineno"> 2358</span>&#160;      <span class="comment">// a consistent definition of the iso-surface</span></div>
<div class="line"><a name="l02359"></a><span class="lineno"> 2359</span>&#160;      TreeOctNode::NeighborKey3 nKey;</div>
<div class="line"><a name="l02360"></a><span class="lineno"> 2360</span>&#160;      nKey.set( maxDepth );</div>
<div class="line"><a name="l02361"></a><span class="lineno"> 2361</span>&#160;      <span class="keywordflow">for</span>( TreeOctNode* leaf=tree.nextLeaf() ; leaf ; leaf=tree.nextLeaf( leaf ) )</div>
<div class="line"><a name="l02362"></a><span class="lineno"> 2362</span>&#160;        <span class="keywordflow">if</span>( leaf-&gt;depth()&gt;sDepth )</div>
<div class="line"><a name="l02363"></a><span class="lineno"> 2363</span>&#160;        {</div>
<div class="line"><a name="l02364"></a><span class="lineno"> 2364</span>&#160;          <span class="keywordtype">int</span> d , off[3] , _off[3];</div>
<div class="line"><a name="l02365"></a><span class="lineno"> 2365</span>&#160;          leaf-&gt;depthAndOffset( d , off );</div>
<div class="line"><a name="l02366"></a><span class="lineno"> 2366</span>&#160;          <span class="keywordtype">int</span> res = (1&lt;&lt;d)-1 , _res = ( 1&lt;&lt;(d-sDepth) )-1;</div>
<div class="line"><a name="l02367"></a><span class="lineno"> 2367</span>&#160;          _off[0] = off[0]&amp;_res , _off[1] = off[1]&amp;_res , _off[2] = off[2]&amp;_res;</div>
<div class="line"><a name="l02368"></a><span class="lineno"> 2368</span>&#160;          <span class="keywordtype">bool</span> boundary[3][2] =</div>
<div class="line"><a name="l02369"></a><span class="lineno"> 2369</span>&#160;          {</div>
<div class="line"><a name="l02370"></a><span class="lineno"> 2370</span>&#160;            { (off[0]!=0 &amp;&amp; _off[0]==0) , (off[0]!=res &amp;&amp; _off[0]==_res) } ,</div>
<div class="line"><a name="l02371"></a><span class="lineno"> 2371</span>&#160;            { (off[1]!=0 &amp;&amp; _off[1]==0) , (off[1]!=res &amp;&amp; _off[1]==_res) } ,</div>
<div class="line"><a name="l02372"></a><span class="lineno"> 2372</span>&#160;            { (off[2]!=0 &amp;&amp; _off[2]==0) , (off[2]!=res &amp;&amp; _off[2]==_res) }</div>
<div class="line"><a name="l02373"></a><span class="lineno"> 2373</span>&#160;          };</div>
<div class="line"><a name="l02374"></a><span class="lineno"> 2374</span>&#160; </div>
<div class="line"><a name="l02375"></a><span class="lineno"> 2375</span>&#160;          <span class="keywordflow">if</span>( boundary[0][0] || boundary[0][1] || boundary[1][0] || boundary[1][1] || boundary[2][0] || boundary[2][1] )</div>
<div class="line"><a name="l02376"></a><span class="lineno"> 2376</span>&#160;          {</div>
<div class="line"><a name="l02377"></a><span class="lineno"> 2377</span>&#160;            TreeOctNode::Neighbors3&amp; neighbors = nKey.getNeighbors( leaf );</div>
<div class="line"><a name="l02378"></a><span class="lineno"> 2378</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;3 ; i++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=0 ; j&lt;3 ; j++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> k=0 ; k&lt;3 ; k++ ) flags[i][j][k] = <span class="keyword">false</span>;</div>
<div class="line"><a name="l02379"></a><span class="lineno"> 2379</span>&#160;            <span class="keywordtype">int</span> x=0 , y=0 , z=0;</div>
<div class="line"><a name="l02380"></a><span class="lineno"> 2380</span>&#160;            <span class="keywordflow">if</span>     ( boundary[0][0] &amp;&amp; !neighbors.neighbors[0][1][1] ) x = -1;</div>
<div class="line"><a name="l02381"></a><span class="lineno"> 2381</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">if</span>( boundary[0][1] &amp;&amp; !neighbors.neighbors[2][1][1] ) x =  1;</div>
<div class="line"><a name="l02382"></a><span class="lineno"> 2382</span>&#160;            <span class="keywordflow">if</span>     ( boundary[1][0] &amp;&amp; !neighbors.neighbors[1][0][1] ) y = -1;</div>
<div class="line"><a name="l02383"></a><span class="lineno"> 2383</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">if</span>( boundary[1][1] &amp;&amp; !neighbors.neighbors[1][2][1] ) y =  1;</div>
<div class="line"><a name="l02384"></a><span class="lineno"> 2384</span>&#160;            <span class="keywordflow">if</span>     ( boundary[2][0] &amp;&amp; !neighbors.neighbors[1][1][0] ) z = -1;</div>
<div class="line"><a name="l02385"></a><span class="lineno"> 2385</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">if</span>( boundary[2][1] &amp;&amp; !neighbors.neighbors[1][1][2] ) z =  1;</div>
<div class="line"><a name="l02386"></a><span class="lineno"> 2386</span>&#160; </div>
<div class="line"><a name="l02387"></a><span class="lineno"> 2387</span>&#160;            <span class="keywordflow">if</span>( x || y || z )</div>
<div class="line"><a name="l02388"></a><span class="lineno"> 2388</span>&#160;            {</div>
<div class="line"><a name="l02389"></a><span class="lineno"> 2389</span>&#160;              <span class="comment">// Corner case</span></div>
<div class="line"><a name="l02390"></a><span class="lineno"> 2390</span>&#160;              <span class="keywordflow">if</span>( x &amp;&amp; y &amp;&amp; z ) flags[1+x][1+y][1+z] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l02391"></a><span class="lineno"> 2391</span>&#160;              <span class="comment">// Edge cases</span></div>
<div class="line"><a name="l02392"></a><span class="lineno"> 2392</span>&#160;              <span class="keywordflow">if</span>( x &amp;&amp; y      ) flags[1+x][1+y][1  ] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l02393"></a><span class="lineno"> 2393</span>&#160;              <span class="keywordflow">if</span>( x &amp;&amp;      z ) flags[1+x][1  ][1+z] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l02394"></a><span class="lineno"> 2394</span>&#160;              <span class="keywordflow">if</span>(      y &amp;&amp; z ) flags[1  ][1+y][1+1] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l02395"></a><span class="lineno"> 2395</span>&#160;              <span class="comment">// Face cases</span></div>
<div class="line"><a name="l02396"></a><span class="lineno"> 2396</span>&#160;              <span class="keywordflow">if</span>( x           ) flags[1+x][1  ][1  ] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l02397"></a><span class="lineno"> 2397</span>&#160;              <span class="keywordflow">if</span>(      y      ) flags[1  ][1+y][1  ] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l02398"></a><span class="lineno"> 2398</span>&#160;              <span class="keywordflow">if</span>(           z ) flags[1  ][1  ][1+z] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l02399"></a><span class="lineno"> 2399</span>&#160;              nKey.setNeighbors( leaf , flags );</div>
<div class="line"><a name="l02400"></a><span class="lineno"> 2400</span>&#160;            }</div>
<div class="line"><a name="l02401"></a><span class="lineno"> 2401</span>&#160;          }</div>
<div class="line"><a name="l02402"></a><span class="lineno"> 2402</span>&#160;        }</div>
<div class="line"><a name="l02403"></a><span class="lineno"> 2403</span>&#160;      _sNodes.set( tree );</div>
<div class="line"><a name="l02404"></a><span class="lineno"> 2404</span>&#160;      MemoryUsage();</div>
<div class="line"><a name="l02405"></a><span class="lineno"> 2405</span>&#160;    }</div>
<div class="line"><a name="l02406"></a><span class="lineno"> 2406</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l02407"></a><span class="lineno"> 2407</span>&#160;    <span class="keywordtype">void</span> Octree&lt;Degree&gt;::GetMCIsoTriangles( Real isoValue , <span class="keywordtype">int</span> subdivideDepth , CoredMeshData* mesh , <span class="keywordtype">int</span> fullDepthIso , <span class="keywordtype">int</span> nonLinearFit , <span class="keywordtype">bool</span> addBarycenter , <span class="keywordtype">bool</span> polygonMesh )</div>
<div class="line"><a name="l02408"></a><span class="lineno"> 2408</span>&#160;    {</div>
<div class="line"><a name="l02409"></a><span class="lineno"> 2409</span>&#160;      fData.setValueTables( fData.VALUE_FLAG | fData.D_VALUE_FLAG , 0 , postNormalSmooth );</div>
<div class="line"><a name="l02410"></a><span class="lineno"> 2410</span>&#160; </div>
<div class="line"><a name="l02411"></a><span class="lineno"> 2411</span>&#160;      <span class="comment">// Ensure that the subtrees are self-contained</span></div>
<div class="line"><a name="l02412"></a><span class="lineno"> 2412</span>&#160;      RefineBoundary( subdivideDepth );</div>
<div class="line"><a name="l02413"></a><span class="lineno"> 2413</span>&#160; </div>
<div class="line"><a name="l02414"></a><span class="lineno"> 2414</span>&#160;      RootData rootData , coarseRootData;</div>
<div class="line"><a name="l02415"></a><span class="lineno"> 2415</span>&#160;      std::vector&lt; Point3D&lt; float &gt; &gt;* interiorPoints;</div>
<div class="line"><a name="l02416"></a><span class="lineno"> 2416</span>&#160;      <span class="keywordtype">int</span> maxDepth = tree.maxDepth();</div>
<div class="line"><a name="l02417"></a><span class="lineno"> 2417</span>&#160; </div>
<div class="line"><a name="l02418"></a><span class="lineno"> 2418</span>&#160;      <span class="keywordtype">int</span> sDepth = subdivideDepth&lt;=0 ? 0 : std::max&lt; int &gt;( 0 , maxDepth-subdivideDepth );</div>
<div class="line"><a name="l02419"></a><span class="lineno"> 2419</span>&#160; </div>
<div class="line"><a name="l02420"></a><span class="lineno"> 2420</span>&#160;      std::vector&lt; Real &gt; metSolution( _sNodes.nodeCount[maxDepth] , 0 );</div>
<div class="line"><a name="l02421"></a><span class="lineno"> 2421</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l02422"></a><span class="lineno"> 2422</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=_sNodes.nodeCount[_minDepth] ; i&lt;_sNodes.nodeCount[maxDepth] ; i++ ) metSolution[i] = _sNodes.treeNodes[i]-&gt;nodeData.solution;</div>
<div class="line"><a name="l02423"></a><span class="lineno"> 2423</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=0 ; d&lt;maxDepth ; d++ ) UpSample( d , _sNodes , &amp;metSolution[0] );</div>
<div class="line"><a name="l02424"></a><span class="lineno"> 2424</span>&#160; </div>
<div class="line"><a name="l02425"></a><span class="lineno"> 2425</span>&#160;      <span class="comment">// Clear the marching cube indices</span></div>
<div class="line"><a name="l02426"></a><span class="lineno"> 2426</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l02427"></a><span class="lineno"> 2427</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;_sNodes.nodeCount[maxDepth+1] ; i++ ) _sNodes.treeNodes[i]-&gt;nodeData.mcIndex = 0;</div>
<div class="line"><a name="l02428"></a><span class="lineno"> 2428</span>&#160; </div>
<div class="line"><a name="l02429"></a><span class="lineno"> 2429</span>&#160;      rootData.boundaryValues = <span class="keyword">new</span> hash_map&lt; <span class="keywordtype">long</span> <span class="keywordtype">long</span> , std::pair&lt; Real , <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> &gt; &gt;();</div>
<div class="line"><a name="l02430"></a><span class="lineno"> 2430</span>&#160;      <span class="keywordtype">int</span> offSet = 0;</div>
<div class="line"><a name="l02431"></a><span class="lineno"> 2431</span>&#160; </div>
<div class="line"><a name="l02432"></a><span class="lineno"> 2432</span>&#160;      <span class="keywordtype">int</span> maxCCount = _sNodes.getMaxCornerCount( &amp;tree , sDepth , maxDepth , threads );</div>
<div class="line"><a name="l02433"></a><span class="lineno"> 2433</span>&#160;      <span class="keywordtype">int</span> maxECount = _sNodes.getMaxEdgeCount  ( &amp;tree , sDepth , threads );</div>
<div class="line"><a name="l02434"></a><span class="lineno"> 2434</span>&#160;      rootData.cornerValues     = <span class="keyword">new</span>          Real  [ maxCCount ];</div>
<div class="line"><a name="l02435"></a><span class="lineno"> 2435</span>&#160;      rootData.cornerNormals    = <span class="keyword">new</span> <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a>[ maxCCount ];</div>
<div class="line"><a name="l02436"></a><span class="lineno"> 2436</span>&#160;      rootData.interiorRoots    = <span class="keyword">new</span> <span class="keywordtype">int</span> [ maxECount ];</div>
<div class="line"><a name="l02437"></a><span class="lineno"> 2437</span>&#160;      rootData.cornerValuesSet  = <span class="keyword">new</span> <span class="keywordtype">char</span>[ maxCCount ];</div>
<div class="line"><a name="l02438"></a><span class="lineno"> 2438</span>&#160;      rootData.cornerNormalsSet = <span class="keyword">new</span> <span class="keywordtype">char</span>[ maxCCount ];</div>
<div class="line"><a name="l02439"></a><span class="lineno"> 2439</span>&#160;      rootData.edgesSet         = <span class="keyword">new</span> <span class="keywordtype">char</span>[ maxECount ];</div>
<div class="line"><a name="l02440"></a><span class="lineno"> 2440</span>&#160;      _sNodes.setCornerTable( coarseRootData , &amp;tree , sDepth , threads );</div>
<div class="line"><a name="l02441"></a><span class="lineno"> 2441</span>&#160;      coarseRootData.cornerValues     = <span class="keyword">new</span>            Real[ coarseRootData.cCount ];</div>
<div class="line"><a name="l02442"></a><span class="lineno"> 2442</span>&#160;      coarseRootData.cornerNormals    = <span class="keyword">new</span> <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a>[ coarseRootData.cCount ];</div>
<div class="line"><a name="l02443"></a><span class="lineno"> 2443</span>&#160;      coarseRootData.cornerValuesSet  = <span class="keyword">new</span>            <span class="keywordtype">char</span>[ coarseRootData.cCount ];</div>
<div class="line"><a name="l02444"></a><span class="lineno"> 2444</span>&#160;      coarseRootData.cornerNormalsSet = <span class="keyword">new</span>            <span class="keywordtype">char</span>[ coarseRootData.cCount ];</div>
<div class="line"><a name="l02445"></a><span class="lineno"> 2445</span>&#160;      memset( coarseRootData.cornerValuesSet  , 0 , <span class="keyword">sizeof</span>( <span class="keywordtype">char</span> ) * coarseRootData.cCount );</div>
<div class="line"><a name="l02446"></a><span class="lineno"> 2446</span>&#160;      memset( coarseRootData.cornerNormalsSet , 0 , <span class="keyword">sizeof</span>( <span class="keywordtype">char</span> ) * coarseRootData.cCount );</div>
<div class="line"><a name="l02447"></a><span class="lineno"> 2447</span>&#160;      MemoryUsage();</div>
<div class="line"><a name="l02448"></a><span class="lineno"> 2448</span>&#160; </div>
<div class="line"><a name="l02449"></a><span class="lineno"> 2449</span>&#160;      std::vector&lt; TreeOctNode::ConstNeighborKey3 &gt; nKeys( threads );</div>
<div class="line"><a name="l02450"></a><span class="lineno"> 2450</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ ) nKeys[t].set( maxDepth );</div>
<div class="line"><a name="l02451"></a><span class="lineno"> 2451</span>&#160;      TreeOctNode::ConstNeighborKey3 nKey;</div>
<div class="line"><a name="l02452"></a><span class="lineno"> 2452</span>&#160;      std::vector&lt; TreeOctNode::ConstNeighborKey5 &gt; nKeys5( threads );</div>
<div class="line"><a name="l02453"></a><span class="lineno"> 2453</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ ) nKeys5[t].set( maxDepth );</div>
<div class="line"><a name="l02454"></a><span class="lineno"> 2454</span>&#160;      TreeOctNode::ConstNeighborKey5 nKey5;</div>
<div class="line"><a name="l02455"></a><span class="lineno"> 2455</span>&#160;      nKey5.set( maxDepth );</div>
<div class="line"><a name="l02456"></a><span class="lineno"> 2456</span>&#160;      nKey.set( maxDepth );</div>
<div class="line"><a name="l02457"></a><span class="lineno"> 2457</span>&#160;      <span class="comment">// First process all leaf nodes at depths strictly finer than sDepth, one subtree at a time.</span></div>
<div class="line"><a name="l02458"></a><span class="lineno"> 2458</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=_sNodes.nodeCount[sDepth] ; i&lt;_sNodes.nodeCount[sDepth+1] ; i++ )</div>
<div class="line"><a name="l02459"></a><span class="lineno"> 2459</span>&#160;      {</div>
<div class="line"><a name="l02460"></a><span class="lineno"> 2460</span>&#160;        <span class="keywordflow">if</span>( !_sNodes.treeNodes[i]-&gt;children ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l02461"></a><span class="lineno"> 2461</span>&#160; </div>
<div class="line"><a name="l02462"></a><span class="lineno"> 2462</span>&#160;        _sNodes.setCornerTable( rootData , _sNodes.treeNodes[i] , threads );</div>
<div class="line"><a name="l02463"></a><span class="lineno"> 2463</span>&#160;        _sNodes.setEdgeTable  ( rootData , _sNodes.treeNodes[i] , threads );</div>
<div class="line"><a name="l02464"></a><span class="lineno"> 2464</span>&#160;        memset( rootData.cornerValuesSet  , 0 , <span class="keyword">sizeof</span>( <span class="keywordtype">char</span> ) * rootData.cCount );</div>
<div class="line"><a name="l02465"></a><span class="lineno"> 2465</span>&#160;        memset( rootData.cornerNormalsSet , 0 , <span class="keyword">sizeof</span>( <span class="keywordtype">char</span> ) * rootData.cCount );</div>
<div class="line"><a name="l02466"></a><span class="lineno"> 2466</span>&#160;        memset( rootData.edgesSet         , 0 , <span class="keyword">sizeof</span>( <span class="keywordtype">char</span> ) * rootData.eCount );</div>
<div class="line"><a name="l02467"></a><span class="lineno"> 2467</span>&#160;        interiorPoints = <span class="keyword">new</span> std::vector&lt; Point3D&lt; float &gt; &gt;();</div>
<div class="line"><a name="l02468"></a><span class="lineno"> 2468</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=maxDepth ; d&gt;sDepth ; d-- )</div>
<div class="line"><a name="l02469"></a><span class="lineno"> 2469</span>&#160;        {</div>
<div class="line"><a name="l02470"></a><span class="lineno"> 2470</span>&#160;          <span class="keywordtype">int</span> leafNodeCount = 0;</div>
<div class="line"><a name="l02471"></a><span class="lineno"> 2471</span>&#160;          std::vector&lt; TreeOctNode* &gt; leafNodes;</div>
<div class="line"><a name="l02472"></a><span class="lineno"> 2472</span>&#160;          <span class="keywordflow">for</span>( TreeOctNode* node=_sNodes.treeNodes[i]-&gt;nextLeaf() ; node ; node=_sNodes.treeNodes[i]-&gt;nextLeaf( node ) ) <span class="keywordflow">if</span>( node-&gt;d==d ) leafNodeCount++;</div>
<div class="line"><a name="l02473"></a><span class="lineno"> 2473</span>&#160;          leafNodes.reserve( leafNodeCount );</div>
<div class="line"><a name="l02474"></a><span class="lineno"> 2474</span>&#160;          <span class="keywordflow">for</span>( TreeOctNode* node=_sNodes.treeNodes[i]-&gt;nextLeaf() ; node ; node=_sNodes.treeNodes[i]-&gt;nextLeaf( node ) ) <span class="keywordflow">if</span>( node-&gt;d==d ) leafNodes.push_back( node );</div>
<div class="line"><a name="l02475"></a><span class="lineno"> 2475</span>&#160;          Stencil&lt; double , 3 &gt; stencil1[8] , stencil2[8][8];</div>
<div class="line"><a name="l02476"></a><span class="lineno"> 2476</span>&#160;          SetEvaluationStencils( d , stencil1 , stencil2 );</div>
<div class="line"><a name="l02477"></a><span class="lineno"> 2477</span>&#160; </div>
<div class="line"><a name="l02478"></a><span class="lineno"> 2478</span>&#160;          <span class="comment">// First set the corner values and associated marching-cube indices</span></div>
<div class="line"><a name="l02479"></a><span class="lineno"> 2479</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l02480"></a><span class="lineno"> 2480</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=(leafNodeCount*t)/threads ; i&lt;(leafNodeCount*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l02481"></a><span class="lineno"> 2481</span>&#160;          {</div>
<div class="line"><a name="l02482"></a><span class="lineno"> 2482</span>&#160;            TreeOctNode* leaf = leafNodes[i];</div>
<div class="line"><a name="l02483"></a><span class="lineno"> 2483</span>&#160;            SetIsoCorners( isoValue , leaf , rootData , rootData.cornerValuesSet , rootData.cornerValues , nKeys[t] , &amp;metSolution[0] , stencil1 , stencil2 );</div>
<div class="line"><a name="l02484"></a><span class="lineno"> 2484</span>&#160; </div>
<div class="line"><a name="l02485"></a><span class="lineno"> 2485</span>&#160;            <span class="comment">// If this node shares a vertex with a coarser node, set the vertex value</span></div>
<div class="line"><a name="l02486"></a><span class="lineno"> 2486</span>&#160;            <span class="keywordtype">int</span> d , off[3];</div>
<div class="line"><a name="l02487"></a><span class="lineno"> 2487</span>&#160;            leaf-&gt;depthAndOffset( d , off );</div>
<div class="line"><a name="l02488"></a><span class="lineno"> 2488</span>&#160;            <span class="keywordtype">int</span> res = 1&lt;&lt;(d-sDepth);</div>
<div class="line"><a name="l02489"></a><span class="lineno"> 2489</span>&#160;            off[0] %= res , off[1] %=res , off[2] %= res;</div>
<div class="line"><a name="l02490"></a><span class="lineno"> 2490</span>&#160;            res--;</div>
<div class="line"><a name="l02491"></a><span class="lineno"> 2491</span>&#160;            <span class="keywordflow">if</span>( !(off[0]%res) &amp;&amp; !(off[1]%res) &amp;&amp; !(off[2]%res) )</div>
<div class="line"><a name="l02492"></a><span class="lineno"> 2492</span>&#160;            {</div>
<div class="line"><a name="l02493"></a><span class="lineno"> 2493</span>&#160;              <span class="keyword">const</span> TreeOctNode* temp = leaf;</div>
<div class="line"><a name="l02494"></a><span class="lineno"> 2494</span>&#160;              <span class="keywordflow">while</span>( temp-&gt;d!=sDepth ) temp = temp-&gt;parent;</div>
<div class="line"><a name="l02495"></a><span class="lineno"> 2495</span>&#160;              <span class="keywordtype">int</span> x = off[0]==0 ? 0 : 1 , y = off[1]==0 ? 0 : 1 , z = off[2]==0 ? 0 : 1;</div>
<div class="line"><a name="l02496"></a><span class="lineno"> 2496</span>&#160;              <span class="keywordtype">int</span> c = Cube::CornerIndex( x , y , z );</div>
<div class="line"><a name="l02497"></a><span class="lineno"> 2497</span>&#160;              <span class="keywordtype">int</span> idx = coarseRootData.cornerIndices( temp )[ c ];</div>
<div class="line"><a name="l02498"></a><span class="lineno"> 2498</span>&#160;              coarseRootData.cornerValues[ idx ] = rootData.cornerValues[ rootData.cornerIndices( leaf )[c] ];</div>
<div class="line"><a name="l02499"></a><span class="lineno"> 2499</span>&#160;              coarseRootData.cornerValuesSet[ idx ] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l02500"></a><span class="lineno"> 2500</span>&#160;            }</div>
<div class="line"><a name="l02501"></a><span class="lineno"> 2501</span>&#160; </div>
<div class="line"><a name="l02502"></a><span class="lineno"> 2502</span>&#160;            <span class="comment">// Compute the iso-vertices</span></div>
<div class="line"><a name="l02503"></a><span class="lineno"> 2503</span>&#160;            <span class="keywordflow">if</span>( MarchingCubes::HasRoots( leaf-&gt;nodeData.mcIndex ) )</div>
<div class="line"><a name="l02504"></a><span class="lineno"> 2504</span>&#160;              SetMCRootPositions( leaf , sDepth , isoValue , nKeys5[t] , rootData , interiorPoints , mesh , &amp;metSolution[0] , nonLinearFit );</div>
<div class="line"><a name="l02505"></a><span class="lineno"> 2505</span>&#160;          }</div>
<div class="line"><a name="l02506"></a><span class="lineno"> 2506</span>&#160;          <span class="comment">// Note that this should be broken off for multi-threading as</span></div>
<div class="line"><a name="l02507"></a><span class="lineno"> 2507</span>&#160;          <span class="comment">// the SetMCRootPositions writes to interiorPoints (with lockupdateing)</span></div>
<div class="line"><a name="l02508"></a><span class="lineno"> 2508</span>&#160;          <span class="comment">// while GetMCIsoTriangles reads from interiorPoints (without locking)</span></div>
<div class="line"><a name="l02509"></a><span class="lineno"> 2509</span>&#160;<span class="preprocessor">#if MISHA_DEBUG</span></div>
<div class="line"><a name="l02510"></a><span class="lineno"> 2510</span>&#160;          std::vector&lt; Point3D&lt; float &gt; &gt; barycenters;</div>
<div class="line"><a name="l02511"></a><span class="lineno"> 2511</span>&#160;          std::vector&lt; Point3D&lt; float &gt; &gt;* barycenterPtr = addBarycenter ? &amp; barycenters : NULL;</div>
<div class="line"><a name="l02512"></a><span class="lineno"> 2512</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// MISHA_DEBUG</span></div>
<div class="line"><a name="l02513"></a><span class="lineno"> 2513</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads )</span></div>
<div class="line"><a name="l02514"></a><span class="lineno"> 2514</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=(leafNodeCount*t)/threads ; i&lt;(leafNodeCount*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l02515"></a><span class="lineno"> 2515</span>&#160;          {</div>
<div class="line"><a name="l02516"></a><span class="lineno"> 2516</span>&#160;            TreeOctNode* leaf = leafNodes[i];</div>
<div class="line"><a name="l02517"></a><span class="lineno"> 2517</span>&#160;            <span class="keywordflow">if</span>( MarchingCubes::HasRoots( leaf-&gt;nodeData.mcIndex ) )</div>
<div class="line"><a name="l02518"></a><span class="lineno"> 2518</span>&#160;#<span class="keywordflow">if</span> MISHA_DEBUG</div>
<div class="line"><a name="l02519"></a><span class="lineno"> 2519</span>&#160;              GetMCIsoTriangles( leaf , mesh , rootData , interiorPoints , offSet , sDepth , polygonMesh , barycenterPtr );</div>
<div class="line"><a name="l02520"></a><span class="lineno"> 2520</span>&#160;<span class="preprocessor">#else </span><span class="comment">// !MISHA_DEBUG</span></div>
<div class="line"><a name="l02521"></a><span class="lineno"> 2521</span>&#160;              GetMCIsoTriangles( leaf , mesh , rootData , interiorPoints , offSet , sDepth , addBarycenter , polygonMesh );</div>
<div class="line"><a name="l02522"></a><span class="lineno"> 2522</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// MISHA_DEBUG</span></div>
<div class="line"><a name="l02523"></a><span class="lineno"> 2523</span>&#160;          }</div>
<div class="line"><a name="l02524"></a><span class="lineno"> 2524</span>&#160;<span class="preprocessor">#if MISHA_DEBUG</span></div>
<div class="line"><a name="l02525"></a><span class="lineno"> 2525</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;barycenters.size() ; i++ ) interiorPoints-&gt;push_back( barycenters[i] );</div>
<div class="line"><a name="l02526"></a><span class="lineno"> 2526</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// MISHA_DEBUG</span></div>
<div class="line"><a name="l02527"></a><span class="lineno"> 2527</span>&#160;        }</div>
<div class="line"><a name="l02528"></a><span class="lineno"> 2528</span>&#160;        offSet = mesh-&gt;outOfCorePointCount();</div>
<div class="line"><a name="l02529"></a><span class="lineno"> 2529</span>&#160;<span class="preprocessor">#if 1</span></div>
<div class="line"><a name="l02530"></a><span class="lineno"> 2530</span>&#160;        <span class="keyword">delete</span> interiorPoints;</div>
<div class="line"><a name="l02531"></a><span class="lineno"> 2531</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l02532"></a><span class="lineno"> 2532</span>&#160;      }</div>
<div class="line"><a name="l02533"></a><span class="lineno"> 2533</span>&#160;      MemoryUsage();</div>
<div class="line"><a name="l02534"></a><span class="lineno"> 2534</span>&#160;      <span class="keyword">delete</span>[] rootData.cornerValues , <span class="keyword">delete</span>[] rootData.cornerNormals , rootData.cornerValues = NULL , rootData.cornerNormals = NULL;</div>
<div class="line"><a name="l02535"></a><span class="lineno"> 2535</span>&#160;      <span class="keyword">delete</span>[] rootData.cornerValuesSet  , <span class="keyword">delete</span>[] rootData.cornerNormalsSet , rootData.cornerValuesSet = NULL , rootData.cornerNormalsSet = NULL;</div>
<div class="line"><a name="l02536"></a><span class="lineno"> 2536</span>&#160;      <span class="keyword">delete</span>[] rootData.interiorRoots ; rootData.interiorRoots = NULL;</div>
<div class="line"><a name="l02537"></a><span class="lineno"> 2537</span>&#160;      <span class="keyword">delete</span>[] rootData.edgesSet ; rootData.edgesSet = NULL;</div>
<div class="line"><a name="l02538"></a><span class="lineno"> 2538</span>&#160;      coarseRootData.interiorRoots = NULL;</div>
<div class="line"><a name="l02539"></a><span class="lineno"> 2539</span>&#160;      coarseRootData.boundaryValues = rootData.boundaryValues;</div>
<div class="line"><a name="l02540"></a><span class="lineno"> 2540</span>&#160;      <span class="keywordflow">for</span>( poisson::hash_map&lt; long long , int &gt;::iterator iter=rootData.boundaryRoots.begin() ; iter!=rootData.boundaryRoots.end() ; iter++ )</div>
<div class="line"><a name="l02541"></a><span class="lineno"> 2541</span>&#160;        coarseRootData.boundaryRoots[iter-&gt;first] = iter-&gt;second;</div>
<div class="line"><a name="l02542"></a><span class="lineno"> 2542</span>&#160; </div>
<div class="line"><a name="l02543"></a><span class="lineno"> 2543</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> d=sDepth ; d&gt;=0 ; d-- )</div>
<div class="line"><a name="l02544"></a><span class="lineno"> 2544</span>&#160;      {</div>
<div class="line"><a name="l02545"></a><span class="lineno"> 2545</span>&#160;        Stencil&lt; double , 3 &gt; stencil1[8] , stencil2[8][8];</div>
<div class="line"><a name="l02546"></a><span class="lineno"> 2546</span>&#160;        SetEvaluationStencils( d , stencil1 , stencil2 );</div>
<div class="line"><a name="l02547"></a><span class="lineno"> 2547</span>&#160;<span class="preprocessor">#if MISHA_DEBUG</span></div>
<div class="line"><a name="l02548"></a><span class="lineno"> 2548</span>&#160;        std::vector&lt; Point3D&lt; float &gt; &gt; barycenters;</div>
<div class="line"><a name="l02549"></a><span class="lineno"> 2549</span>&#160;        std::vector&lt; Point3D&lt; float &gt; &gt;* barycenterPtr = addBarycenter ? &amp;barycenters : NULL;</div>
<div class="line"><a name="l02550"></a><span class="lineno"> 2550</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// MISHA_DEBUG</span></div>
<div class="line"><a name="l02551"></a><span class="lineno"> 2551</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=_sNodes.nodeCount[d] ; i&lt;_sNodes.nodeCount[d+1] ; i++ )</div>
<div class="line"><a name="l02552"></a><span class="lineno"> 2552</span>&#160;        {</div>
<div class="line"><a name="l02553"></a><span class="lineno"> 2553</span>&#160;          TreeOctNode* leaf = _sNodes.treeNodes[i];</div>
<div class="line"><a name="l02554"></a><span class="lineno"> 2554</span>&#160;          <span class="keywordflow">if</span>( leaf-&gt;children ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l02555"></a><span class="lineno"> 2555</span>&#160; </div>
<div class="line"><a name="l02556"></a><span class="lineno"> 2556</span>&#160;          <span class="comment">// First set the corner values and associated marching-cube indices</span></div>
<div class="line"><a name="l02557"></a><span class="lineno"> 2557</span>&#160;          SetIsoCorners( isoValue , leaf , coarseRootData , coarseRootData.cornerValuesSet , coarseRootData.cornerValues , nKey , &amp;metSolution[0] , stencil1 , stencil2 );</div>
<div class="line"><a name="l02558"></a><span class="lineno"> 2558</span>&#160; </div>
<div class="line"><a name="l02559"></a><span class="lineno"> 2559</span>&#160;          <span class="comment">// Now compute the iso-vertices</span></div>
<div class="line"><a name="l02560"></a><span class="lineno"> 2560</span>&#160;          <span class="keywordflow">if</span>( MarchingCubes::HasRoots( leaf-&gt;nodeData.mcIndex ) )</div>
<div class="line"><a name="l02561"></a><span class="lineno"> 2561</span>&#160;          {</div>
<div class="line"><a name="l02562"></a><span class="lineno"> 2562</span>&#160;            SetMCRootPositions( leaf , 0 , isoValue , nKey5 , coarseRootData , NULL , mesh , &amp;metSolution[0] , nonLinearFit );</div>
<div class="line"><a name="l02563"></a><span class="lineno"> 2563</span>&#160;<span class="preprocessor">#if MISHA_DEBUG</span></div>
<div class="line"><a name="l02564"></a><span class="lineno"> 2564</span>&#160;            GetMCIsoTriangles( leaf , mesh , coarseRootData , NULL , 0 , 0 , polygonMesh , barycenterPtr );</div>
<div class="line"><a name="l02565"></a><span class="lineno"> 2565</span>&#160;<span class="preprocessor">#else </span><span class="comment">// !MISHA_DEBUG</span></div>
<div class="line"><a name="l02566"></a><span class="lineno"> 2566</span>&#160;            GetMCIsoTriangles( leaf , mesh , coarseRootData , NULL , 0 , 0 , addBarycenter , polygonMesh );</div>
<div class="line"><a name="l02567"></a><span class="lineno"> 2567</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// MISHA_DEBUG</span></div>
<div class="line"><a name="l02568"></a><span class="lineno"> 2568</span>&#160;          }</div>
<div class="line"><a name="l02569"></a><span class="lineno"> 2569</span>&#160;        }</div>
<div class="line"><a name="l02570"></a><span class="lineno"> 2570</span>&#160;      }</div>
<div class="line"><a name="l02571"></a><span class="lineno"> 2571</span>&#160;      MemoryUsage();</div>
<div class="line"><a name="l02572"></a><span class="lineno"> 2572</span>&#160; </div>
<div class="line"><a name="l02573"></a><span class="lineno"> 2573</span>&#160;      <span class="keyword">delete</span>[] coarseRootData.cornerValues , <span class="keyword">delete</span>[] coarseRootData.cornerNormals;</div>
<div class="line"><a name="l02574"></a><span class="lineno"> 2574</span>&#160;      <span class="keyword">delete</span>[] coarseRootData.cornerValuesSet  , <span class="keyword">delete</span>[] coarseRootData.cornerNormalsSet;</div>
<div class="line"><a name="l02575"></a><span class="lineno"> 2575</span>&#160;      <span class="keyword">delete</span> rootData.boundaryValues;</div>
<div class="line"><a name="l02576"></a><span class="lineno"> 2576</span>&#160;    }</div>
<div class="line"><a name="l02577"></a><span class="lineno"> 2577</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l02578"></a><span class="lineno"> 2578</span>&#160;    Real Octree&lt;Degree&gt;::getCenterValue( <span class="keyword">const</span> OctNode&lt; TreeNodeData , Real &gt;::ConstNeighborKey3&amp; neighborKey , <span class="keyword">const</span> TreeOctNode* node){</div>
<div class="line"><a name="l02579"></a><span class="lineno"> 2579</span>&#160;      <span class="keywordtype">int</span> idx[3];</div>
<div class="line"><a name="l02580"></a><span class="lineno"> 2580</span>&#160;      Real value=0;</div>
<div class="line"><a name="l02581"></a><span class="lineno"> 2581</span>&#160; </div>
<div class="line"><a name="l02582"></a><span class="lineno"> 2582</span>&#160;      VertexData::CenterIndex(node,fData.depth,idx);</div>
<div class="line"><a name="l02583"></a><span class="lineno"> 2583</span>&#160;      idx[0]*=fData.functionCount;</div>
<div class="line"><a name="l02584"></a><span class="lineno"> 2584</span>&#160;      idx[1]*=fData.functionCount;</div>
<div class="line"><a name="l02585"></a><span class="lineno"> 2585</span>&#160;      idx[2]*=fData.functionCount;</div>
<div class="line"><a name="l02586"></a><span class="lineno"> 2586</span>&#160;      <span class="keywordtype">int</span> minDepth = std::max&lt; int &gt;( 0 , std::min&lt; int &gt;( _minDepth , node-&gt;depth()-1 ) );</div>
<div class="line"><a name="l02587"></a><span class="lineno"> 2587</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=minDepth ; i&lt;=node-&gt;depth() ; i++ )</div>
<div class="line"><a name="l02588"></a><span class="lineno"> 2588</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=0;j&lt;3;j++)</div>
<div class="line"><a name="l02589"></a><span class="lineno"> 2589</span>&#160;          <span class="keywordflow">for</span>(<span class="keywordtype">int</span> k=0;k&lt;3;k++)</div>
<div class="line"><a name="l02590"></a><span class="lineno"> 2590</span>&#160;            <span class="keywordflow">for</span>(<span class="keywordtype">int</span> l=0;l&lt;3;l++)</div>
<div class="line"><a name="l02591"></a><span class="lineno"> 2591</span>&#160;            {</div>
<div class="line"><a name="l02592"></a><span class="lineno"> 2592</span>&#160;              <span class="keyword">const</span> TreeOctNode* n=neighborKey.neighbors[i].neighbors[j][k][l];</div>
<div class="line"><a name="l02593"></a><span class="lineno"> 2593</span>&#160;              <span class="keywordflow">if</span>( n )</div>
<div class="line"><a name="l02594"></a><span class="lineno"> 2594</span>&#160;              {</div>
<div class="line"><a name="l02595"></a><span class="lineno"> 2595</span>&#160;                Real temp=n-&gt;nodeData.solution;</div>
<div class="line"><a name="l02596"></a><span class="lineno"> 2596</span>&#160;                value+=temp*Real(</div>
<div class="line"><a name="l02597"></a><span class="lineno"> 2597</span>&#160;                         fData.valueTables[idx[0]+<span class="keywordtype">int</span>(n-&gt;off[0])]*</div>
<div class="line"><a name="l02598"></a><span class="lineno"> 2598</span>&#160;                         fData.valueTables[idx[1]+<span class="keywordtype">int</span>(n-&gt;off[1])]*</div>
<div class="line"><a name="l02599"></a><span class="lineno"> 2599</span>&#160;                         fData.valueTables[idx[2]+<span class="keywordtype">int</span>(n-&gt;off[2])]);</div>
<div class="line"><a name="l02600"></a><span class="lineno"> 2600</span>&#160;              }</div>
<div class="line"><a name="l02601"></a><span class="lineno"> 2601</span>&#160;            }</div>
<div class="line"><a name="l02602"></a><span class="lineno"> 2602</span>&#160;      <span class="keywordflow">if</span>(node-&gt;children)</div>
<div class="line"><a name="l02603"></a><span class="lineno"> 2603</span>&#160;      {</div>
<div class="line"><a name="l02604"></a><span class="lineno"> 2604</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;Cube::CORNERS;i++){</div>
<div class="line"><a name="l02605"></a><span class="lineno"> 2605</span>&#160;          <span class="keywordtype">int</span> ii=Cube::AntipodalCornerIndex(i);</div>
<div class="line"><a name="l02606"></a><span class="lineno"> 2606</span>&#160;          <span class="keyword">const</span> TreeOctNode* n=&amp;node-&gt;children[i];</div>
<div class="line"><a name="l02607"></a><span class="lineno"> 2607</span>&#160;          <span class="keywordflow">while</span>(1){</div>
<div class="line"><a name="l02608"></a><span class="lineno"> 2608</span>&#160;            value+=n-&gt;nodeData.solution*Real(</div>
<div class="line"><a name="l02609"></a><span class="lineno"> 2609</span>&#160;                     fData.valueTables[idx[0]+<span class="keywordtype">int</span>(n-&gt;off[0])]*</div>
<div class="line"><a name="l02610"></a><span class="lineno"> 2610</span>&#160;                     fData.valueTables[idx[1]+<span class="keywordtype">int</span>(n-&gt;off[1])]*</div>
<div class="line"><a name="l02611"></a><span class="lineno"> 2611</span>&#160;                     fData.valueTables[idx[2]+<span class="keywordtype">int</span>(n-&gt;off[2])]);</div>
<div class="line"><a name="l02612"></a><span class="lineno"> 2612</span>&#160;            <span class="keywordflow">if</span>( n-&gt;children ) n=&amp;n-&gt;children[ii];</div>
<div class="line"><a name="l02613"></a><span class="lineno"> 2613</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02614"></a><span class="lineno"> 2614</span>&#160;          }</div>
<div class="line"><a name="l02615"></a><span class="lineno"> 2615</span>&#160;        }</div>
<div class="line"><a name="l02616"></a><span class="lineno"> 2616</span>&#160;      }</div>
<div class="line"><a name="l02617"></a><span class="lineno"> 2617</span>&#160;      <span class="keywordflow">return</span> value;</div>
<div class="line"><a name="l02618"></a><span class="lineno"> 2618</span>&#160;    }</div>
<div class="line"><a name="l02619"></a><span class="lineno"> 2619</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l02620"></a><span class="lineno"> 2620</span>&#160;    Real Octree&lt; Degree &gt;::getCornerValue( <span class="keyword">const</span> OctNode&lt; TreeNodeData , Real &gt;::ConstNeighborKey3&amp; neighborKey3 , <span class="keyword">const</span> TreeOctNode* node , <span class="keywordtype">int</span> corner , <span class="keyword">const</span> Real* metSolution )</div>
<div class="line"><a name="l02621"></a><span class="lineno"> 2621</span>&#160;    {</div>
<div class="line"><a name="l02622"></a><span class="lineno"> 2622</span>&#160;      <span class="keywordtype">int</span> idx[3];</div>
<div class="line"><a name="l02623"></a><span class="lineno"> 2623</span>&#160;      <span class="keywordtype">double</span> value = 0;</div>
<div class="line"><a name="l02624"></a><span class="lineno"> 2624</span>&#160; </div>
<div class="line"><a name="l02625"></a><span class="lineno"> 2625</span>&#160;      VertexData::CornerIndex( node , corner , fData.depth , idx );</div>
<div class="line"><a name="l02626"></a><span class="lineno"> 2626</span>&#160;      idx[0] *= fData.functionCount;</div>
<div class="line"><a name="l02627"></a><span class="lineno"> 2627</span>&#160;      idx[1] *= fData.functionCount;</div>
<div class="line"><a name="l02628"></a><span class="lineno"> 2628</span>&#160;      idx[2] *= fData.functionCount;</div>
<div class="line"><a name="l02629"></a><span class="lineno"> 2629</span>&#160; </div>
<div class="line"><a name="l02630"></a><span class="lineno"> 2630</span>&#160;      <span class="keywordtype">int</span> d = node-&gt;depth();</div>
<div class="line"><a name="l02631"></a><span class="lineno"> 2631</span>&#160;      <span class="keywordtype">int</span> cx , cy , cz;</div>
<div class="line"><a name="l02632"></a><span class="lineno"> 2632</span>&#160;      <span class="keywordtype">int</span> startX = 0 , endX = 3 , startY = 0 , endY = 3 , startZ = 0 , endZ = 3;</div>
<div class="line"><a name="l02633"></a><span class="lineno"> 2633</span>&#160;      Cube::FactorCornerIndex( corner , cx , cy , cz );</div>
<div class="line"><a name="l02634"></a><span class="lineno"> 2634</span>&#160;      {</div>
<div class="line"><a name="l02635"></a><span class="lineno"> 2635</span>&#160;        TreeOctNode::ConstNeighbors3&amp; neighbors = neighborKey3.neighbors[d];</div>
<div class="line"><a name="l02636"></a><span class="lineno"> 2636</span>&#160;        <span class="keywordflow">if</span>( cx==0 ) endX = 2;</div>
<div class="line"><a name="l02637"></a><span class="lineno"> 2637</span>&#160;        <span class="keywordflow">else</span>      startX = 1;</div>
<div class="line"><a name="l02638"></a><span class="lineno"> 2638</span>&#160;        <span class="keywordflow">if</span>( cy==0 ) endY = 2;</div>
<div class="line"><a name="l02639"></a><span class="lineno"> 2639</span>&#160;        <span class="keywordflow">else</span>      startY = 1;</div>
<div class="line"><a name="l02640"></a><span class="lineno"> 2640</span>&#160;        <span class="keywordflow">if</span>( cz==0 ) endZ = 2;</div>
<div class="line"><a name="l02641"></a><span class="lineno"> 2641</span>&#160;        <span class="keywordflow">else</span>      startZ = 1;</div>
<div class="line"><a name="l02642"></a><span class="lineno"> 2642</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=startX ; x&lt;endX ; x++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=startY ; y&lt;endY ; y++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=startZ ; z&lt;endZ ; z++ )</div>
<div class="line"><a name="l02643"></a><span class="lineno"> 2643</span>&#160;        {</div>
<div class="line"><a name="l02644"></a><span class="lineno"> 2644</span>&#160;          <span class="keyword">const</span> TreeOctNode* n=neighbors.neighbors[x][y][z];</div>
<div class="line"><a name="l02645"></a><span class="lineno"> 2645</span>&#160;          <span class="keywordflow">if</span>( n )</div>
<div class="line"><a name="l02646"></a><span class="lineno"> 2646</span>&#160;          {</div>
<div class="line"><a name="l02647"></a><span class="lineno"> 2647</span>&#160;            <span class="keywordtype">double</span> v =</div>
<div class="line"><a name="l02648"></a><span class="lineno"> 2648</span>&#160;                fData.valueTables[ idx[0]+int(n-&gt;off[0]) ]*</div>
<div class="line"><a name="l02649"></a><span class="lineno"> 2649</span>&#160;                fData.valueTables[ idx[1]+int(n-&gt;off[1]) ]*</div>
<div class="line"><a name="l02650"></a><span class="lineno"> 2650</span>&#160;                fData.valueTables[ idx[2]+int(n-&gt;off[2]) ];</div>
<div class="line"><a name="l02651"></a><span class="lineno"> 2651</span>&#160;            value += n-&gt;nodeData.solution * v;</div>
<div class="line"><a name="l02652"></a><span class="lineno"> 2652</span>&#160;          }</div>
<div class="line"><a name="l02653"></a><span class="lineno"> 2653</span>&#160;        }</div>
<div class="line"><a name="l02654"></a><span class="lineno"> 2654</span>&#160;      }</div>
<div class="line"><a name="l02655"></a><span class="lineno"> 2655</span>&#160;      <span class="keywordflow">if</span>( d&gt;0 &amp;&amp; d&gt;_minDepth )</div>
<div class="line"><a name="l02656"></a><span class="lineno"> 2656</span>&#160;      {</div>
<div class="line"><a name="l02657"></a><span class="lineno"> 2657</span>&#160;        <span class="keywordtype">int</span> _corner = int( node - node-&gt;parent-&gt;children );</div>
<div class="line"><a name="l02658"></a><span class="lineno"> 2658</span>&#160;        <span class="keywordtype">int</span> _cx , _cy , _cz;</div>
<div class="line"><a name="l02659"></a><span class="lineno"> 2659</span>&#160;        Cube::FactorCornerIndex( _corner , _cx , _cy , _cz );</div>
<div class="line"><a name="l02660"></a><span class="lineno"> 2660</span>&#160;        <span class="keywordflow">if</span>( cx!=_cx ) startX = 0 , endX = 3;</div>
<div class="line"><a name="l02661"></a><span class="lineno"> 2661</span>&#160;        <span class="keywordflow">if</span>( cy!=_cy ) startY = 0 , endY = 3;</div>
<div class="line"><a name="l02662"></a><span class="lineno"> 2662</span>&#160;        <span class="keywordflow">if</span>( cz!=_cz ) startZ = 0 , endZ = 3;</div>
<div class="line"><a name="l02663"></a><span class="lineno"> 2663</span>&#160;        TreeOctNode::ConstNeighbors3&amp; neighbors = neighborKey3.neighbors[d-1];</div>
<div class="line"><a name="l02664"></a><span class="lineno"> 2664</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=startX ; x&lt;endX ; x++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=startY ; y&lt;endY ; y++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=startZ ; z&lt;endZ ; z++ )</div>
<div class="line"><a name="l02665"></a><span class="lineno"> 2665</span>&#160;        {</div>
<div class="line"><a name="l02666"></a><span class="lineno"> 2666</span>&#160;          <span class="keyword">const</span> TreeOctNode* n=neighbors.neighbors[x][y][z];</div>
<div class="line"><a name="l02667"></a><span class="lineno"> 2667</span>&#160;          <span class="keywordflow">if</span>( n )</div>
<div class="line"><a name="l02668"></a><span class="lineno"> 2668</span>&#160;          {</div>
<div class="line"><a name="l02669"></a><span class="lineno"> 2669</span>&#160;            <span class="keywordtype">double</span> v =</div>
<div class="line"><a name="l02670"></a><span class="lineno"> 2670</span>&#160;                fData.valueTables[ idx[0]+int(n-&gt;off[0]) ]*</div>
<div class="line"><a name="l02671"></a><span class="lineno"> 2671</span>&#160;                fData.valueTables[ idx[1]+int(n-&gt;off[1]) ]*</div>
<div class="line"><a name="l02672"></a><span class="lineno"> 2672</span>&#160;                fData.valueTables[ idx[2]+int(n-&gt;off[2]) ];</div>
<div class="line"><a name="l02673"></a><span class="lineno"> 2673</span>&#160;            value += metSolution[ n-&gt;nodeData.nodeIndex ] * v;</div>
<div class="line"><a name="l02674"></a><span class="lineno"> 2674</span>&#160;          }</div>
<div class="line"><a name="l02675"></a><span class="lineno"> 2675</span>&#160;        }</div>
<div class="line"><a name="l02676"></a><span class="lineno"> 2676</span>&#160;      }</div>
<div class="line"><a name="l02677"></a><span class="lineno"> 2677</span>&#160;      <span class="keywordflow">return</span> Real( value );</div>
<div class="line"><a name="l02678"></a><span class="lineno"> 2678</span>&#160;    }</div>
<div class="line"><a name="l02679"></a><span class="lineno"> 2679</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l02680"></a><span class="lineno"> 2680</span>&#160;    Real Octree&lt; Degree &gt;::getCornerValue( <span class="keyword">const</span> OctNode&lt; TreeNodeData , Real &gt;::ConstNeighborKey3&amp; neighborKey3 , <span class="keyword">const</span> TreeOctNode* node , <span class="keywordtype">int</span> corner , <span class="keyword">const</span> Real* metSolution , <span class="keyword">const</span> <span class="keywordtype">double</span> stencil1[3][3][3] , <span class="keyword">const</span> <span class="keywordtype">double</span> stencil2[3][3][3] )</div>
<div class="line"><a name="l02681"></a><span class="lineno"> 2681</span>&#160;    {</div>
<div class="line"><a name="l02682"></a><span class="lineno"> 2682</span>&#160;      <span class="keywordtype">double</span> value = 0;</div>
<div class="line"><a name="l02683"></a><span class="lineno"> 2683</span>&#160;      <span class="keywordtype">int</span> d = node-&gt;depth();</div>
<div class="line"><a name="l02684"></a><span class="lineno"> 2684</span>&#160;      <span class="keywordtype">int</span> cx , cy , cz;</div>
<div class="line"><a name="l02685"></a><span class="lineno"> 2685</span>&#160;      <span class="keywordtype">int</span> startX = 0 , endX = 3 , startY = 0 , endY = 3 , startZ = 0 , endZ = 3;</div>
<div class="line"><a name="l02686"></a><span class="lineno"> 2686</span>&#160;      Cube::FactorCornerIndex( corner , cx , cy , cz );</div>
<div class="line"><a name="l02687"></a><span class="lineno"> 2687</span>&#160;      {</div>
<div class="line"><a name="l02688"></a><span class="lineno"> 2688</span>&#160;        TreeOctNode::ConstNeighbors3&amp; neighbors = neighborKey3.neighbors[d];</div>
<div class="line"><a name="l02689"></a><span class="lineno"> 2689</span>&#160;        <span class="keywordflow">if</span>( cx==0 ) endX = 2;</div>
<div class="line"><a name="l02690"></a><span class="lineno"> 2690</span>&#160;        <span class="keywordflow">else</span>      startX = 1;</div>
<div class="line"><a name="l02691"></a><span class="lineno"> 2691</span>&#160;        <span class="keywordflow">if</span>( cy==0 ) endY = 2;</div>
<div class="line"><a name="l02692"></a><span class="lineno"> 2692</span>&#160;        <span class="keywordflow">else</span>      startY = 1;</div>
<div class="line"><a name="l02693"></a><span class="lineno"> 2693</span>&#160;        <span class="keywordflow">if</span>( cz==0 ) endZ = 2;</div>
<div class="line"><a name="l02694"></a><span class="lineno"> 2694</span>&#160;        <span class="keywordflow">else</span>      startZ = 1;</div>
<div class="line"><a name="l02695"></a><span class="lineno"> 2695</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=startX ; x&lt;endX ; x++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=startY ; y&lt;endY ; y++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=startZ ; z&lt;endZ ; z++ )</div>
<div class="line"><a name="l02696"></a><span class="lineno"> 2696</span>&#160;        {</div>
<div class="line"><a name="l02697"></a><span class="lineno"> 2697</span>&#160;          <span class="keyword">const</span> TreeOctNode* n=neighbors.neighbors[x][y][z];</div>
<div class="line"><a name="l02698"></a><span class="lineno"> 2698</span>&#160;          <span class="keywordflow">if</span>( n ) value += n-&gt;nodeData.solution * stencil1[x][y][z];</div>
<div class="line"><a name="l02699"></a><span class="lineno"> 2699</span>&#160;        }</div>
<div class="line"><a name="l02700"></a><span class="lineno"> 2700</span>&#160;      }</div>
<div class="line"><a name="l02701"></a><span class="lineno"> 2701</span>&#160;      <span class="keywordflow">if</span>( d&gt;0 &amp;&amp; d&gt;_minDepth )</div>
<div class="line"><a name="l02702"></a><span class="lineno"> 2702</span>&#160;      {</div>
<div class="line"><a name="l02703"></a><span class="lineno"> 2703</span>&#160;        <span class="keywordtype">int</span> _corner = int( node - node-&gt;parent-&gt;children );</div>
<div class="line"><a name="l02704"></a><span class="lineno"> 2704</span>&#160;        <span class="keywordtype">int</span> _cx , _cy , _cz;</div>
<div class="line"><a name="l02705"></a><span class="lineno"> 2705</span>&#160;        Cube::FactorCornerIndex( _corner , _cx , _cy , _cz );</div>
<div class="line"><a name="l02706"></a><span class="lineno"> 2706</span>&#160;        <span class="keywordflow">if</span>( cx!=_cx ) startX = 0 , endX = 3;</div>
<div class="line"><a name="l02707"></a><span class="lineno"> 2707</span>&#160;        <span class="keywordflow">if</span>( cy!=_cy ) startY = 0 , endY = 3;</div>
<div class="line"><a name="l02708"></a><span class="lineno"> 2708</span>&#160;        <span class="keywordflow">if</span>( cz!=_cz ) startZ = 0 , endZ = 3;</div>
<div class="line"><a name="l02709"></a><span class="lineno"> 2709</span>&#160;        TreeOctNode::ConstNeighbors3&amp; neighbors = neighborKey3.neighbors[d-1];</div>
<div class="line"><a name="l02710"></a><span class="lineno"> 2710</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=startX ; x&lt;endX ; x++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=startY ; y&lt;endY ; y++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=startZ ; z&lt;endZ ; z++ )</div>
<div class="line"><a name="l02711"></a><span class="lineno"> 2711</span>&#160;        {</div>
<div class="line"><a name="l02712"></a><span class="lineno"> 2712</span>&#160;          <span class="keyword">const</span> TreeOctNode* n=neighbors.neighbors[x][y][z];</div>
<div class="line"><a name="l02713"></a><span class="lineno"> 2713</span>&#160;          <span class="keywordflow">if</span>( n ) value += metSolution[ n-&gt;nodeData.nodeIndex ] * stencil2[x][y][z];</div>
<div class="line"><a name="l02714"></a><span class="lineno"> 2714</span>&#160;        }</div>
<div class="line"><a name="l02715"></a><span class="lineno"> 2715</span>&#160;      }</div>
<div class="line"><a name="l02716"></a><span class="lineno"> 2716</span>&#160;      <span class="keywordflow">return</span> Real( value );</div>
<div class="line"><a name="l02717"></a><span class="lineno"> 2717</span>&#160;    }</div>
<div class="line"><a name="l02718"></a><span class="lineno"> 2718</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l02719"></a><span class="lineno"> 2719</span>&#160;    <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> Octree&lt; Degree &gt;::getCornerNormal( <span class="keyword">const</span> OctNode&lt; TreeNodeData , Real &gt;::ConstNeighborKey5&amp; neighborKey5 , <span class="keyword">const</span> TreeOctNode* node , <span class="keywordtype">int</span> corner , <span class="keyword">const</span> Real* metSolution )</div>
<div class="line"><a name="l02720"></a><span class="lineno"> 2720</span>&#160;    {</div>
<div class="line"><a name="l02721"></a><span class="lineno"> 2721</span>&#160;      <span class="keywordtype">int</span> idx[3];</div>
<div class="line"><a name="l02722"></a><span class="lineno"> 2722</span>&#160;      <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> normal;</div>
<div class="line"><a name="l02723"></a><span class="lineno"> 2723</span>&#160;      normal[0] = normal[1] = normal[2] = 0.;</div>
<div class="line"><a name="l02724"></a><span class="lineno"> 2724</span>&#160; </div>
<div class="line"><a name="l02725"></a><span class="lineno"> 2725</span>&#160;      VertexData::CornerIndex( node , corner , fData.depth , idx );</div>
<div class="line"><a name="l02726"></a><span class="lineno"> 2726</span>&#160;      idx[0] *= fData.functionCount;</div>
<div class="line"><a name="l02727"></a><span class="lineno"> 2727</span>&#160;      idx[1] *= fData.functionCount;</div>
<div class="line"><a name="l02728"></a><span class="lineno"> 2728</span>&#160;      idx[2] *= fData.functionCount;</div>
<div class="line"><a name="l02729"></a><span class="lineno"> 2729</span>&#160; </div>
<div class="line"><a name="l02730"></a><span class="lineno"> 2730</span>&#160;      <span class="keywordtype">int</span> d = node-&gt;depth();</div>
<div class="line"><a name="l02731"></a><span class="lineno"> 2731</span>&#160;      <span class="comment">// Iterate over all ancestors that can overlap the corner</span></div>
<div class="line"><a name="l02732"></a><span class="lineno"> 2732</span>&#160;      {</div>
<div class="line"><a name="l02733"></a><span class="lineno"> 2733</span>&#160;        TreeOctNode::ConstNeighbors5&amp; neighbors = neighborKey5.neighbors[d];</div>
<div class="line"><a name="l02734"></a><span class="lineno"> 2734</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=0 ; j&lt;5 ; j++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> k=0 ; k&lt;5 ; k++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> l=0 ; l&lt;5 ; l++ )</div>
<div class="line"><a name="l02735"></a><span class="lineno"> 2735</span>&#160;        {</div>
<div class="line"><a name="l02736"></a><span class="lineno"> 2736</span>&#160;          <span class="keyword">const</span> TreeOctNode* n=neighbors.neighbors[j][k][l];</div>
<div class="line"><a name="l02737"></a><span class="lineno"> 2737</span>&#160;          <span class="keywordflow">if</span>( n )</div>
<div class="line"><a name="l02738"></a><span class="lineno"> 2738</span>&#160;          {</div>
<div class="line"><a name="l02739"></a><span class="lineno"> 2739</span>&#160;            <span class="keywordtype">int</span> _idx[] = { idx[0] + n-&gt;off[0] , idx[1] + n-&gt;off[1] , idx[2] + n-&gt;off[2] };</div>
<div class="line"><a name="l02740"></a><span class="lineno"> 2740</span>&#160;            <span class="keywordtype">double</span>  values[] = {  fData.valueTables[_idx[0]] ,  fData.valueTables[_idx[1]] ,  fData.valueTables[_idx[2]] };</div>
<div class="line"><a name="l02741"></a><span class="lineno"> 2741</span>&#160;            <span class="keywordtype">double</span> dValues[] = { fData.dValueTables[_idx[0]] , fData.dValueTables[_idx[1]] , fData.dValueTables[_idx[2]] };</div>
<div class="line"><a name="l02742"></a><span class="lineno"> 2742</span>&#160;            Real solution = n-&gt;nodeData.solution;</div>
<div class="line"><a name="l02743"></a><span class="lineno"> 2743</span>&#160;            normal[0] += Real( dValues[0] *  values[1] *  values[2] * solution );</div>
<div class="line"><a name="l02744"></a><span class="lineno"> 2744</span>&#160;            normal[1] += Real(  values[0] * dValues[1] *  values[2] * solution );</div>
<div class="line"><a name="l02745"></a><span class="lineno"> 2745</span>&#160;            normal[2] += Real(  values[0] *  values[1] * dValues[2] * solution );</div>
<div class="line"><a name="l02746"></a><span class="lineno"> 2746</span>&#160;          }</div>
<div class="line"><a name="l02747"></a><span class="lineno"> 2747</span>&#160;        }</div>
<div class="line"><a name="l02748"></a><span class="lineno"> 2748</span>&#160;      }</div>
<div class="line"><a name="l02749"></a><span class="lineno"> 2749</span>&#160;      <span class="keywordflow">if</span>( d&gt;0 &amp;&amp; d&gt;_minDepth )</div>
<div class="line"><a name="l02750"></a><span class="lineno"> 2750</span>&#160;      {</div>
<div class="line"><a name="l02751"></a><span class="lineno"> 2751</span>&#160;        TreeOctNode::ConstNeighbors5&amp; neighbors = neighborKey5.neighbors[d-1];</div>
<div class="line"><a name="l02752"></a><span class="lineno"> 2752</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=0 ; j&lt;5 ; j++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> k=0 ; k&lt;5 ; k++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> l=0 ; l&lt;5 ; l++ )</div>
<div class="line"><a name="l02753"></a><span class="lineno"> 2753</span>&#160;        {</div>
<div class="line"><a name="l02754"></a><span class="lineno"> 2754</span>&#160;          <span class="keyword">const</span> TreeOctNode* n=neighbors.neighbors[j][k][l];</div>
<div class="line"><a name="l02755"></a><span class="lineno"> 2755</span>&#160;          <span class="keywordflow">if</span>( n )</div>
<div class="line"><a name="l02756"></a><span class="lineno"> 2756</span>&#160;          {</div>
<div class="line"><a name="l02757"></a><span class="lineno"> 2757</span>&#160;            <span class="keywordtype">int</span> _idx[] = { idx[0] + n-&gt;off[0] , idx[1] + n-&gt;off[1] , idx[2] + n-&gt;off[2] };</div>
<div class="line"><a name="l02758"></a><span class="lineno"> 2758</span>&#160;            <span class="keywordtype">double</span>  values[] = {  fData.valueTables[_idx[0]] ,  fData.valueTables[_idx[1]] ,  fData.valueTables[_idx[2]] };</div>
<div class="line"><a name="l02759"></a><span class="lineno"> 2759</span>&#160;            <span class="keywordtype">double</span> dValues[] = { fData.dValueTables[_idx[0]] , fData.dValueTables[_idx[1]] , fData.dValueTables[_idx[2]] };</div>
<div class="line"><a name="l02760"></a><span class="lineno"> 2760</span>&#160;            Real solution = metSolution[ n-&gt;nodeData.nodeIndex ];</div>
<div class="line"><a name="l02761"></a><span class="lineno"> 2761</span>&#160;            normal[0] += Real( dValues[0] *  values[1] *  values[2] * solution );</div>
<div class="line"><a name="l02762"></a><span class="lineno"> 2762</span>&#160;            normal[1] += Real(  values[0] * dValues[1] *  values[2] * solution );</div>
<div class="line"><a name="l02763"></a><span class="lineno"> 2763</span>&#160;            normal[2] += Real(  values[0] *  values[1] * dValues[2] * solution );</div>
<div class="line"><a name="l02764"></a><span class="lineno"> 2764</span>&#160;          }</div>
<div class="line"><a name="l02765"></a><span class="lineno"> 2765</span>&#160;        }</div>
<div class="line"><a name="l02766"></a><span class="lineno"> 2766</span>&#160;      }</div>
<div class="line"><a name="l02767"></a><span class="lineno"> 2767</span>&#160;      <span class="keywordflow">return</span> normal;</div>
<div class="line"><a name="l02768"></a><span class="lineno"> 2768</span>&#160;    }</div>
<div class="line"><a name="l02769"></a><span class="lineno"> 2769</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l02770"></a><span class="lineno"> 2770</span>&#160;    Real Octree&lt;Degree&gt;::GetIsoValue( <span class="keywordtype">void</span> )</div>
<div class="line"><a name="l02771"></a><span class="lineno"> 2771</span>&#160;    {</div>
<div class="line"><a name="l02772"></a><span class="lineno"> 2772</span>&#160;      Real isoValue , weightSum;</div>
<div class="line"><a name="l02773"></a><span class="lineno"> 2773</span>&#160; </div>
<div class="line"><a name="l02774"></a><span class="lineno"> 2774</span>&#160;      neighborKey2.set( fData.depth );</div>
<div class="line"><a name="l02775"></a><span class="lineno"> 2775</span>&#160;      fData.setValueTables( fData.VALUE_FLAG , 0 );</div>
<div class="line"><a name="l02776"></a><span class="lineno"> 2776</span>&#160; </div>
<div class="line"><a name="l02777"></a><span class="lineno"> 2777</span>&#160;      isoValue = weightSum = 0;</div>
<div class="line"><a name="l02778"></a><span class="lineno"> 2778</span>&#160;<span class="preprocessor">#pragma omp parallel for num_threads( threads ) reduction( + : isoValue , weightSum )</span></div>
<div class="line"><a name="l02779"></a><span class="lineno"> 2779</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> t=0 ; t&lt;threads ; t++)</div>
<div class="line"><a name="l02780"></a><span class="lineno"> 2780</span>&#160;      {</div>
<div class="line"><a name="l02781"></a><span class="lineno"> 2781</span>&#160;        TreeOctNode::ConstNeighborKey3 nKey;</div>
<div class="line"><a name="l02782"></a><span class="lineno"> 2782</span>&#160;        nKey.set( _sNodes.maxDepth-1 );</div>
<div class="line"><a name="l02783"></a><span class="lineno"> 2783</span>&#160;        <span class="keywordtype">int</span> nodeCount = _sNodes.nodeCount[ _sNodes.maxDepth ];</div>
<div class="line"><a name="l02784"></a><span class="lineno"> 2784</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=(nodeCount*t)/threads ; i&lt;(nodeCount*(t+1))/threads ; i++ )</div>
<div class="line"><a name="l02785"></a><span class="lineno"> 2785</span>&#160;        {</div>
<div class="line"><a name="l02786"></a><span class="lineno"> 2786</span>&#160;          TreeOctNode* temp = _sNodes.treeNodes[i];</div>
<div class="line"><a name="l02787"></a><span class="lineno"> 2787</span>&#160;          nKey.getNeighbors( temp );</div>
<div class="line"><a name="l02788"></a><span class="lineno"> 2788</span>&#160;          Real w = temp-&gt;nodeData.centerWeightContribution;</div>
<div class="line"><a name="l02789"></a><span class="lineno"> 2789</span>&#160;          <span class="keywordflow">if</span>( w!=0 )</div>
<div class="line"><a name="l02790"></a><span class="lineno"> 2790</span>&#160;          {</div>
<div class="line"><a name="l02791"></a><span class="lineno"> 2791</span>&#160;            isoValue += getCenterValue( nKey , temp ) * w;</div>
<div class="line"><a name="l02792"></a><span class="lineno"> 2792</span>&#160;            weightSum += w;</div>
<div class="line"><a name="l02793"></a><span class="lineno"> 2793</span>&#160;          }</div>
<div class="line"><a name="l02794"></a><span class="lineno"> 2794</span>&#160;        }</div>
<div class="line"><a name="l02795"></a><span class="lineno"> 2795</span>&#160;      }</div>
<div class="line"><a name="l02796"></a><span class="lineno"> 2796</span>&#160;      <span class="keywordflow">return</span> isoValue/weightSum;</div>
<div class="line"><a name="l02797"></a><span class="lineno"> 2797</span>&#160;    }</div>
<div class="line"><a name="l02798"></a><span class="lineno"> 2798</span>&#160; </div>
<div class="line"><a name="l02799"></a><span class="lineno"> 2799</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l02800"></a><span class="lineno"> 2800</span>&#160;    <span class="keywordtype">void</span> Octree&lt; Degree &gt;::SetIsoCorners( Real isoValue , TreeOctNode* leaf , SortedTreeNodes::CornerTableData&amp; cData , <span class="keywordtype">char</span>* valuesSet , Real* values , TreeOctNode::ConstNeighborKey3&amp; nKey , <span class="keyword">const</span> Real* metSolution , <span class="keyword">const</span> Stencil&lt; double , 3 &gt; stencil1[8] , <span class="keyword">const</span> Stencil&lt; double , 3 &gt; stencil2[8][8] )</div>
<div class="line"><a name="l02801"></a><span class="lineno"> 2801</span>&#160;    {</div>
<div class="line"><a name="l02802"></a><span class="lineno"> 2802</span>&#160;      Real cornerValues[ Cube::CORNERS ];</div>
<div class="line"><a name="l02803"></a><span class="lineno"> 2803</span>&#160;      <span class="keyword">const</span> SortedTreeNodes::CornerIndices&amp; cIndices = cData[ leaf ];</div>
<div class="line"><a name="l02804"></a><span class="lineno"> 2804</span>&#160; </div>
<div class="line"><a name="l02805"></a><span class="lineno"> 2805</span>&#160;      <span class="keywordtype">bool</span> isInterior;</div>
<div class="line"><a name="l02806"></a><span class="lineno"> 2806</span>&#160;      <span class="keywordtype">int</span> d , off[3];</div>
<div class="line"><a name="l02807"></a><span class="lineno"> 2807</span>&#160;      leaf-&gt;depthAndOffset( d , off );</div>
<div class="line"><a name="l02808"></a><span class="lineno"> 2808</span>&#160;      <span class="keywordtype">int</span> mn = 2 , mx = (1&lt;&lt;d)-2;</div>
<div class="line"><a name="l02809"></a><span class="lineno"> 2809</span>&#160;      isInterior = ( off[0]&gt;=mn &amp;&amp; off[0]&lt;mx &amp;&amp; off[1]&gt;=mn &amp;&amp; off[1]&lt;mx &amp;&amp; off[2]&gt;=mn &amp;&amp; off[2]&lt;mx );</div>
<div class="line"><a name="l02810"></a><span class="lineno"> 2810</span>&#160;      nKey.getNeighbors( leaf );</div>
<div class="line"><a name="l02811"></a><span class="lineno"> 2811</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> c=0 ; c&lt;Cube::CORNERS ; c++ )</div>
<div class="line"><a name="l02812"></a><span class="lineno"> 2812</span>&#160;      {</div>
<div class="line"><a name="l02813"></a><span class="lineno"> 2813</span>&#160;        <span class="keywordtype">int</span> vIndex = cIndices[c];</div>
<div class="line"><a name="l02814"></a><span class="lineno"> 2814</span>&#160;        <span class="keywordflow">if</span>( valuesSet[vIndex] ) cornerValues[c] = values[vIndex];</div>
<div class="line"><a name="l02815"></a><span class="lineno"> 2815</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l02816"></a><span class="lineno"> 2816</span>&#160;        {</div>
<div class="line"><a name="l02817"></a><span class="lineno"> 2817</span>&#160;          <span class="keywordflow">if</span>( isInterior ) cornerValues[c] = getCornerValue( nKey , leaf , c , metSolution , stencil1[c].values , stencil2[<span class="keywordtype">int</span>(leaf - leaf-&gt;parent-&gt;children)][c].values );</div>
<div class="line"><a name="l02818"></a><span class="lineno"> 2818</span>&#160;          <span class="keywordflow">else</span>             cornerValues[c] = getCornerValue( nKey , leaf , c , metSolution );</div>
<div class="line"><a name="l02819"></a><span class="lineno"> 2819</span>&#160;          values[vIndex] = cornerValues[c];</div>
<div class="line"><a name="l02820"></a><span class="lineno"> 2820</span>&#160;          valuesSet[vIndex] = 1;</div>
<div class="line"><a name="l02821"></a><span class="lineno"> 2821</span>&#160;        }</div>
<div class="line"><a name="l02822"></a><span class="lineno"> 2822</span>&#160;      }</div>
<div class="line"><a name="l02823"></a><span class="lineno"> 2823</span>&#160; </div>
<div class="line"><a name="l02824"></a><span class="lineno"> 2824</span>&#160;      leaf-&gt;nodeData.mcIndex = MarchingCubes::GetIndex( cornerValues , isoValue );</div>
<div class="line"><a name="l02825"></a><span class="lineno"> 2825</span>&#160; </div>
<div class="line"><a name="l02826"></a><span class="lineno"> 2826</span>&#160;      <span class="comment">// Set the marching cube indices for all interior nodes.</span></div>
<div class="line"><a name="l02827"></a><span class="lineno"> 2827</span>&#160;      <span class="keywordflow">if</span>( leaf-&gt;parent )</div>
<div class="line"><a name="l02828"></a><span class="lineno"> 2828</span>&#160;      {</div>
<div class="line"><a name="l02829"></a><span class="lineno"> 2829</span>&#160;        TreeOctNode* parent = leaf-&gt;parent;</div>
<div class="line"><a name="l02830"></a><span class="lineno"> 2830</span>&#160;        <span class="keywordtype">int</span> c = int( leaf - leaf-&gt;parent-&gt;children );</div>
<div class="line"><a name="l02831"></a><span class="lineno"> 2831</span>&#160;        <span class="keywordtype">int</span> mcid = leaf-&gt;nodeData.mcIndex &amp; (1&lt;&lt;MarchingCubes::cornerMap()[c]);</div>
<div class="line"><a name="l02832"></a><span class="lineno"> 2832</span>&#160; </div>
<div class="line"><a name="l02833"></a><span class="lineno"> 2833</span>&#160;        <span class="keywordflow">if</span>( mcid )</div>
<div class="line"><a name="l02834"></a><span class="lineno"> 2834</span>&#160;        {</div>
<div class="line"><a name="l02835"></a><span class="lineno"> 2835</span>&#160;          poisson::atomicOr(parent-&gt;nodeData.mcIndex, mcid);</div>
<div class="line"><a name="l02836"></a><span class="lineno"> 2836</span>&#160; </div>
<div class="line"><a name="l02837"></a><span class="lineno"> 2837</span>&#160;          <span class="keywordflow">while</span>( 1 )</div>
<div class="line"><a name="l02838"></a><span class="lineno"> 2838</span>&#160;          {</div>
<div class="line"><a name="l02839"></a><span class="lineno"> 2839</span>&#160;            <span class="keywordflow">if</span>( parent-&gt;parent &amp;&amp; parent-&gt;parent-&gt;d&gt;=_minDepth &amp;&amp; (parent-parent-&gt;parent-&gt;children)==c )</div>
<div class="line"><a name="l02840"></a><span class="lineno"> 2840</span>&#160;            {</div>
<div class="line"><a name="l02841"></a><span class="lineno"> 2841</span>&#160;              poisson::atomicOr(parent-&gt;parent-&gt;nodeData.mcIndex, mcid);</div>
<div class="line"><a name="l02842"></a><span class="lineno"> 2842</span>&#160;              parent = parent-&gt;parent;</div>
<div class="line"><a name="l02843"></a><span class="lineno"> 2843</span>&#160;            }</div>
<div class="line"><a name="l02844"></a><span class="lineno"> 2844</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02845"></a><span class="lineno"> 2845</span>&#160;          }</div>
<div class="line"><a name="l02846"></a><span class="lineno"> 2846</span>&#160;        }</div>
<div class="line"><a name="l02847"></a><span class="lineno"> 2847</span>&#160;      }</div>
<div class="line"><a name="l02848"></a><span class="lineno"> 2848</span>&#160;    }</div>
<div class="line"><a name="l02849"></a><span class="lineno"> 2849</span>&#160; </div>
<div class="line"><a name="l02850"></a><span class="lineno"> 2850</span>&#160; </div>
<div class="line"><a name="l02851"></a><span class="lineno"> 2851</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l02852"></a><span class="lineno"> 2852</span>&#160;    <span class="keywordtype">int</span> Octree&lt;Degree&gt;::InteriorFaceRootCount(<span class="keyword">const</span> TreeOctNode* node,<span class="keyword">const</span> <span class="keywordtype">int</span> &amp;faceIndex,<span class="keywordtype">int</span> maxDepth){</div>
<div class="line"><a name="l02853"></a><span class="lineno"> 2853</span>&#160;      <span class="keywordtype">int</span> c1,c2,e1,e2,dir,off,cnt=0;</div>
<div class="line"><a name="l02854"></a><span class="lineno"> 2854</span>&#160;      <span class="keywordtype">int</span> corners[Cube::CORNERS/2];</div>
<div class="line"><a name="l02855"></a><span class="lineno"> 2855</span>&#160;      <span class="keywordflow">if</span>(node-&gt;children){</div>
<div class="line"><a name="l02856"></a><span class="lineno"> 2856</span>&#160;        Cube::FaceCorners(faceIndex,corners[0],corners[1],corners[2],corners[3]);</div>
<div class="line"><a name="l02857"></a><span class="lineno"> 2857</span>&#160;        Cube::FactorFaceIndex(faceIndex,dir,off);</div>
<div class="line"><a name="l02858"></a><span class="lineno"> 2858</span>&#160;        c1=corners[0];</div>
<div class="line"><a name="l02859"></a><span class="lineno"> 2859</span>&#160;        c2=corners[3];</div>
<div class="line"><a name="l02860"></a><span class="lineno"> 2860</span>&#160;        <span class="keywordflow">switch</span>(dir){</div>
<div class="line"><a name="l02861"></a><span class="lineno"> 2861</span>&#160;        <span class="keywordflow">case</span> 0:</div>
<div class="line"><a name="l02862"></a><span class="lineno"> 2862</span>&#160;          e1=Cube::EdgeIndex(1,off,1);</div>
<div class="line"><a name="l02863"></a><span class="lineno"> 2863</span>&#160;          e2=Cube::EdgeIndex(2,off,1);</div>
<div class="line"><a name="l02864"></a><span class="lineno"> 2864</span>&#160;          <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02865"></a><span class="lineno"> 2865</span>&#160;        <span class="keywordflow">case</span> 1:</div>
<div class="line"><a name="l02866"></a><span class="lineno"> 2866</span>&#160;          e1=Cube::EdgeIndex(0,off,1);</div>
<div class="line"><a name="l02867"></a><span class="lineno"> 2867</span>&#160;          e2=Cube::EdgeIndex(2,1,off);</div>
<div class="line"><a name="l02868"></a><span class="lineno"> 2868</span>&#160;          <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02869"></a><span class="lineno"> 2869</span>&#160;        <span class="keywordflow">case</span> 2:</div>
<div class="line"><a name="l02870"></a><span class="lineno"> 2870</span>&#160;          e1=Cube::EdgeIndex(0,1,off);</div>
<div class="line"><a name="l02871"></a><span class="lineno"> 2871</span>&#160;          e2=Cube::EdgeIndex(1,1,off);</div>
<div class="line"><a name="l02872"></a><span class="lineno"> 2872</span>&#160;          <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02873"></a><span class="lineno"> 2873</span>&#160;        };</div>
<div class="line"><a name="l02874"></a><span class="lineno"> 2874</span>&#160;        cnt+=EdgeRootCount(&amp;node-&gt;children[c1],e1,maxDepth)+EdgeRootCount(&amp;node-&gt;children[c1],e2,maxDepth);</div>
<div class="line"><a name="l02875"></a><span class="lineno"> 2875</span>&#160;        <span class="keywordflow">switch</span>(dir){</div>
<div class="line"><a name="l02876"></a><span class="lineno"> 2876</span>&#160;        <span class="keywordflow">case</span> 0:</div>
<div class="line"><a name="l02877"></a><span class="lineno"> 2877</span>&#160;          e1=Cube::EdgeIndex(1,off,0);</div>
<div class="line"><a name="l02878"></a><span class="lineno"> 2878</span>&#160;          e2=Cube::EdgeIndex(2,off,0);</div>
<div class="line"><a name="l02879"></a><span class="lineno"> 2879</span>&#160;          <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02880"></a><span class="lineno"> 2880</span>&#160;        <span class="keywordflow">case</span> 1:</div>
<div class="line"><a name="l02881"></a><span class="lineno"> 2881</span>&#160;          e1=Cube::EdgeIndex(0,off,0);</div>
<div class="line"><a name="l02882"></a><span class="lineno"> 2882</span>&#160;          e2=Cube::EdgeIndex(2,0,off);</div>
<div class="line"><a name="l02883"></a><span class="lineno"> 2883</span>&#160;          <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02884"></a><span class="lineno"> 2884</span>&#160;        <span class="keywordflow">case</span> 2:</div>
<div class="line"><a name="l02885"></a><span class="lineno"> 2885</span>&#160;          e1=Cube::EdgeIndex(0,0,off);</div>
<div class="line"><a name="l02886"></a><span class="lineno"> 2886</span>&#160;          e2=Cube::EdgeIndex(1,0,off);</div>
<div class="line"><a name="l02887"></a><span class="lineno"> 2887</span>&#160;          <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02888"></a><span class="lineno"> 2888</span>&#160;        };</div>
<div class="line"><a name="l02889"></a><span class="lineno"> 2889</span>&#160;        cnt+=EdgeRootCount(&amp;node-&gt;children[c2],e1,maxDepth)+EdgeRootCount(&amp;node-&gt;children[c2],e2,maxDepth);</div>
<div class="line"><a name="l02890"></a><span class="lineno"> 2890</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;Cube::CORNERS/2;i++){<span class="keywordflow">if</span>(node-&gt;children[corners[i]].children){cnt+=InteriorFaceRootCount(&amp;node-&gt;children[corners[i]],faceIndex,maxDepth);}}</div>
<div class="line"><a name="l02891"></a><span class="lineno"> 2891</span>&#160;      }</div>
<div class="line"><a name="l02892"></a><span class="lineno"> 2892</span>&#160;      <span class="keywordflow">return</span> cnt;</div>
<div class="line"><a name="l02893"></a><span class="lineno"> 2893</span>&#160;    }</div>
<div class="line"><a name="l02894"></a><span class="lineno"> 2894</span>&#160; </div>
<div class="line"><a name="l02895"></a><span class="lineno"> 2895</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l02896"></a><span class="lineno"> 2896</span>&#160;    <span class="keywordtype">int</span> Octree&lt;Degree&gt;::EdgeRootCount(<span class="keyword">const</span> TreeOctNode* node,<span class="keywordtype">int</span> edgeIndex,<span class="keywordtype">int</span> maxDepth){</div>
<div class="line"><a name="l02897"></a><span class="lineno"> 2897</span>&#160;      <span class="keywordtype">int</span> f1,f2,c1,c2;</div>
<div class="line"><a name="l02898"></a><span class="lineno"> 2898</span>&#160;      <span class="keyword">const</span> TreeOctNode* temp;</div>
<div class="line"><a name="l02899"></a><span class="lineno"> 2899</span>&#160;      Cube::FacesAdjacentToEdge(edgeIndex,f1,f2);</div>
<div class="line"><a name="l02900"></a><span class="lineno"> 2900</span>&#160; </div>
<div class="line"><a name="l02901"></a><span class="lineno"> 2901</span>&#160;      <span class="keywordtype">int</span> eIndex;</div>
<div class="line"><a name="l02902"></a><span class="lineno"> 2902</span>&#160;      <span class="keyword">const</span> TreeOctNode* finest=node;</div>
<div class="line"><a name="l02903"></a><span class="lineno"> 2903</span>&#160;      eIndex=edgeIndex;</div>
<div class="line"><a name="l02904"></a><span class="lineno"> 2904</span>&#160;      <span class="keywordflow">if</span>(node-&gt;depth()&lt;maxDepth){</div>
<div class="line"><a name="l02905"></a><span class="lineno"> 2905</span>&#160;        temp=node-&gt;faceNeighbor(f1);</div>
<div class="line"><a name="l02906"></a><span class="lineno"> 2906</span>&#160;        <span class="keywordflow">if</span>(temp &amp;&amp; temp-&gt;children){</div>
<div class="line"><a name="l02907"></a><span class="lineno"> 2907</span>&#160;          finest=temp;</div>
<div class="line"><a name="l02908"></a><span class="lineno"> 2908</span>&#160;          eIndex=Cube::FaceReflectEdgeIndex(edgeIndex,f1);</div>
<div class="line"><a name="l02909"></a><span class="lineno"> 2909</span>&#160;        }</div>
<div class="line"><a name="l02910"></a><span class="lineno"> 2910</span>&#160;        <span class="keywordflow">else</span>{</div>
<div class="line"><a name="l02911"></a><span class="lineno"> 2911</span>&#160;          temp=node-&gt;faceNeighbor(f2);</div>
<div class="line"><a name="l02912"></a><span class="lineno"> 2912</span>&#160;          <span class="keywordflow">if</span>(temp &amp;&amp; temp-&gt;children){</div>
<div class="line"><a name="l02913"></a><span class="lineno"> 2913</span>&#160;            finest=temp;</div>
<div class="line"><a name="l02914"></a><span class="lineno"> 2914</span>&#160;            eIndex=Cube::FaceReflectEdgeIndex(edgeIndex,f2);</div>
<div class="line"><a name="l02915"></a><span class="lineno"> 2915</span>&#160;          }</div>
<div class="line"><a name="l02916"></a><span class="lineno"> 2916</span>&#160;          <span class="keywordflow">else</span>{</div>
<div class="line"><a name="l02917"></a><span class="lineno"> 2917</span>&#160;            temp=node-&gt;edgeNeighbor(edgeIndex);</div>
<div class="line"><a name="l02918"></a><span class="lineno"> 2918</span>&#160;            <span class="keywordflow">if</span>(temp &amp;&amp; temp-&gt;children){</div>
<div class="line"><a name="l02919"></a><span class="lineno"> 2919</span>&#160;              finest=temp;</div>
<div class="line"><a name="l02920"></a><span class="lineno"> 2920</span>&#160;              eIndex=Cube::EdgeReflectEdgeIndex(edgeIndex);</div>
<div class="line"><a name="l02921"></a><span class="lineno"> 2921</span>&#160;            }</div>
<div class="line"><a name="l02922"></a><span class="lineno"> 2922</span>&#160;          }</div>
<div class="line"><a name="l02923"></a><span class="lineno"> 2923</span>&#160;        }</div>
<div class="line"><a name="l02924"></a><span class="lineno"> 2924</span>&#160;      }</div>
<div class="line"><a name="l02925"></a><span class="lineno"> 2925</span>&#160; </div>
<div class="line"><a name="l02926"></a><span class="lineno"> 2926</span>&#160;      Cube::EdgeCorners(eIndex,c1,c2);</div>
<div class="line"><a name="l02927"></a><span class="lineno"> 2927</span>&#160;      <span class="keywordflow">if</span>(finest-&gt;children) <span class="keywordflow">return</span> EdgeRootCount(&amp;finest-&gt;children[c1],eIndex,maxDepth)+EdgeRootCount(&amp;finest-&gt;children[c2],eIndex,maxDepth);</div>
<div class="line"><a name="l02928"></a><span class="lineno"> 2928</span>&#160;      <span class="keywordflow">else</span> <span class="keywordflow">return</span> MarchingCubes::HasEdgeRoots(finest-&gt;nodeData.mcIndex,eIndex);</div>
<div class="line"><a name="l02929"></a><span class="lineno"> 2929</span>&#160;    }</div>
<div class="line"><a name="l02930"></a><span class="lineno"> 2930</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l02931"></a><span class="lineno"> 2931</span>&#160;    <span class="keywordtype">int</span> Octree&lt;Degree&gt;::IsBoundaryFace(<span class="keyword">const</span> TreeOctNode* node,<span class="keywordtype">int</span> faceIndex,<span class="keywordtype">int</span> subdivideDepth){</div>
<div class="line"><a name="l02932"></a><span class="lineno"> 2932</span>&#160;      <span class="keywordtype">int</span> dir,offset,d,o[3],idx;</div>
<div class="line"><a name="l02933"></a><span class="lineno"> 2933</span>&#160; </div>
<div class="line"><a name="l02934"></a><span class="lineno"> 2934</span>&#160;      <span class="keywordflow">if</span>(subdivideDepth&lt;0){<span class="keywordflow">return</span> 0;}</div>
<div class="line"><a name="l02935"></a><span class="lineno"> 2935</span>&#160;      <span class="keywordflow">if</span>(node-&gt;d&lt;=subdivideDepth){<span class="keywordflow">return</span> 1;}</div>
<div class="line"><a name="l02936"></a><span class="lineno"> 2936</span>&#160;      Cube::FactorFaceIndex(faceIndex,dir,offset);</div>
<div class="line"><a name="l02937"></a><span class="lineno"> 2937</span>&#160;      node-&gt;depthAndOffset(d,o);</div>
<div class="line"><a name="l02938"></a><span class="lineno"> 2938</span>&#160; </div>
<div class="line"><a name="l02939"></a><span class="lineno"> 2939</span>&#160;      idx=(int(o[dir])&lt;&lt;1) + (offset&lt;&lt;1);</div>
<div class="line"><a name="l02940"></a><span class="lineno"> 2940</span>&#160;      <span class="keywordflow">return</span> !(idx%(2&lt;&lt;(int(node-&gt;d)-subdivideDepth)));</div>
<div class="line"><a name="l02941"></a><span class="lineno"> 2941</span>&#160;    }</div>
<div class="line"><a name="l02942"></a><span class="lineno"> 2942</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l02943"></a><span class="lineno"> 2943</span>&#160;    <span class="keywordtype">int</span> Octree&lt;Degree&gt;::IsBoundaryEdge(<span class="keyword">const</span> TreeOctNode* node,<span class="keywordtype">int</span> edgeIndex,<span class="keywordtype">int</span> subdivideDepth){</div>
<div class="line"><a name="l02944"></a><span class="lineno"> 2944</span>&#160;      <span class="keywordtype">int</span> dir,x,y;</div>
<div class="line"><a name="l02945"></a><span class="lineno"> 2945</span>&#160;      Cube::FactorEdgeIndex(edgeIndex,dir,x,y);</div>
<div class="line"><a name="l02946"></a><span class="lineno"> 2946</span>&#160;      <span class="keywordflow">return</span> IsBoundaryEdge(node,dir,x,y,subdivideDepth);</div>
<div class="line"><a name="l02947"></a><span class="lineno"> 2947</span>&#160;    }</div>
<div class="line"><a name="l02948"></a><span class="lineno"> 2948</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l02949"></a><span class="lineno"> 2949</span>&#160;    <span class="keywordtype">int</span> Octree&lt;Degree&gt;::IsBoundaryEdge( <span class="keyword">const</span> TreeOctNode* node , <span class="keywordtype">int</span> dir , <span class="keywordtype">int</span> x , <span class="keywordtype">int</span> y , <span class="keywordtype">int</span> subdivideDepth )</div>
<div class="line"><a name="l02950"></a><span class="lineno"> 2950</span>&#160;    {</div>
<div class="line"><a name="l02951"></a><span class="lineno"> 2951</span>&#160;      <span class="keywordtype">int</span> d , o[3] , idx1 , idx2 , mask;</div>
<div class="line"><a name="l02952"></a><span class="lineno"> 2952</span>&#160; </div>
<div class="line"><a name="l02953"></a><span class="lineno"> 2953</span>&#160;      <span class="keywordflow">if</span>( subdivideDepth&lt;0 ) <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l02954"></a><span class="lineno"> 2954</span>&#160;      <span class="keywordflow">if</span>( node-&gt;d&lt;=subdivideDepth ) <span class="keywordflow">return</span> 1;</div>
<div class="line"><a name="l02955"></a><span class="lineno"> 2955</span>&#160;      node-&gt;depthAndOffset( d , o );</div>
<div class="line"><a name="l02956"></a><span class="lineno"> 2956</span>&#160; </div>
<div class="line"><a name="l02957"></a><span class="lineno"> 2957</span>&#160;      <span class="keywordflow">switch</span>( dir )</div>
<div class="line"><a name="l02958"></a><span class="lineno"> 2958</span>&#160;      {</div>
<div class="line"><a name="l02959"></a><span class="lineno"> 2959</span>&#160;      <span class="keywordflow">case</span> 0:</div>
<div class="line"><a name="l02960"></a><span class="lineno"> 2960</span>&#160;        idx1 = o[1] + x;</div>
<div class="line"><a name="l02961"></a><span class="lineno"> 2961</span>&#160;        idx2 = o[2] + y;</div>
<div class="line"><a name="l02962"></a><span class="lineno"> 2962</span>&#160;        <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02963"></a><span class="lineno"> 2963</span>&#160;      <span class="keywordflow">case</span> 1:</div>
<div class="line"><a name="l02964"></a><span class="lineno"> 2964</span>&#160;        idx1 = o[0] + x;</div>
<div class="line"><a name="l02965"></a><span class="lineno"> 2965</span>&#160;        idx2 = o[2] + y;</div>
<div class="line"><a name="l02966"></a><span class="lineno"> 2966</span>&#160;        <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02967"></a><span class="lineno"> 2967</span>&#160;      <span class="keywordflow">case</span> 2:</div>
<div class="line"><a name="l02968"></a><span class="lineno"> 2968</span>&#160;        idx1 = o[0] + x;</div>
<div class="line"><a name="l02969"></a><span class="lineno"> 2969</span>&#160;        idx2 = o[1] + y;</div>
<div class="line"><a name="l02970"></a><span class="lineno"> 2970</span>&#160;        <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02971"></a><span class="lineno"> 2971</span>&#160;      }</div>
<div class="line"><a name="l02972"></a><span class="lineno"> 2972</span>&#160;      mask = 1&lt;&lt;( int(node-&gt;d) - subdivideDepth );</div>
<div class="line"><a name="l02973"></a><span class="lineno"> 2973</span>&#160;      <span class="keywordflow">return</span> !(idx1%(mask)) || !(idx2%(mask));</div>
<div class="line"><a name="l02974"></a><span class="lineno"> 2974</span>&#160;    }</div>
<div class="line"><a name="l02975"></a><span class="lineno"> 2975</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l02976"></a><span class="lineno"> 2976</span>&#160;    <span class="keywordtype">void</span> Octree&lt; Degree &gt;::GetRootSpan( <span class="keyword">const</span> RootInfo&amp; ri , <a class="code" href="structpcl_1_1poisson_1_1_point3_d.html">Point3D&lt; float &gt;</a>&amp; start , <a class="code" href="structpcl_1_1poisson_1_1_point3_d.html">Point3D&lt; float &gt;</a>&amp; end )</div>
<div class="line"><a name="l02977"></a><span class="lineno"> 2977</span>&#160;    {</div>
<div class="line"><a name="l02978"></a><span class="lineno"> 2978</span>&#160;      <span class="keywordtype">int</span> o , i1 , i2;</div>
<div class="line"><a name="l02979"></a><span class="lineno"> 2979</span>&#160;      Real width;</div>
<div class="line"><a name="l02980"></a><span class="lineno"> 2980</span>&#160;      <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> c;</div>
<div class="line"><a name="l02981"></a><span class="lineno"> 2981</span>&#160; </div>
<div class="line"><a name="l02982"></a><span class="lineno"> 2982</span>&#160;      Cube::FactorEdgeIndex( ri.edgeIndex , o , i1 , i2 );</div>
<div class="line"><a name="l02983"></a><span class="lineno"> 2983</span>&#160;      ri.node-&gt;centerAndWidth( c , width );</div>
<div class="line"><a name="l02984"></a><span class="lineno"> 2984</span>&#160;      <span class="keywordflow">switch</span>(o)</div>
<div class="line"><a name="l02985"></a><span class="lineno"> 2985</span>&#160;      {</div>
<div class="line"><a name="l02986"></a><span class="lineno"> 2986</span>&#160;      <span class="keywordflow">case</span> 0:</div>
<div class="line"><a name="l02987"></a><span class="lineno"> 2987</span>&#160;        start[0]          = c[0] - width/2;</div>
<div class="line"><a name="l02988"></a><span class="lineno"> 2988</span>&#160;        end  [0]          = c[0] + width/2;</div>
<div class="line"><a name="l02989"></a><span class="lineno"> 2989</span>&#160;        start[1] = end[1] = c[1] - width/2 + width*i1;</div>
<div class="line"><a name="l02990"></a><span class="lineno"> 2990</span>&#160;        start[2] = end[2] = c[2] - width/2 + width*i2;</div>
<div class="line"><a name="l02991"></a><span class="lineno"> 2991</span>&#160;        <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02992"></a><span class="lineno"> 2992</span>&#160;      <span class="keywordflow">case</span> 1:</div>
<div class="line"><a name="l02993"></a><span class="lineno"> 2993</span>&#160;        start[0] = end[0] = c[0] - width/2 + width*i1;</div>
<div class="line"><a name="l02994"></a><span class="lineno"> 2994</span>&#160;        start[1]          = c[1] - width/2;</div>
<div class="line"><a name="l02995"></a><span class="lineno"> 2995</span>&#160;        end  [1]          = c[1] + width/2;</div>
<div class="line"><a name="l02996"></a><span class="lineno"> 2996</span>&#160;        start[2] = end[2] = c[2] - width/2 + width*i2;</div>
<div class="line"><a name="l02997"></a><span class="lineno"> 2997</span>&#160;        <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l02998"></a><span class="lineno"> 2998</span>&#160;      <span class="keywordflow">case</span> 2:</div>
<div class="line"><a name="l02999"></a><span class="lineno"> 2999</span>&#160;        start[0] = end[0] = c[0] - width/2 + width*i1;</div>
<div class="line"><a name="l03000"></a><span class="lineno"> 3000</span>&#160;        start[1] = end[1] = c[1] - width/2 + width*i2;</div>
<div class="line"><a name="l03001"></a><span class="lineno"> 3001</span>&#160;        start[2]          = c[2] - width/2;</div>
<div class="line"><a name="l03002"></a><span class="lineno"> 3002</span>&#160;        end  [2]          = c[2] + width/2;</div>
<div class="line"><a name="l03003"></a><span class="lineno"> 3003</span>&#160;        <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l03004"></a><span class="lineno"> 3004</span>&#160;      }</div>
<div class="line"><a name="l03005"></a><span class="lineno"> 3005</span>&#160;    }</div>
<div class="line"><a name="l03007"></a><span class="lineno"> 3007</span>&#160;    <span class="comment">// The assumption made when calling this code is that the edge has at most one root //</span></div>
<div class="line"><a name="l03009"></a><span class="lineno"> 3009</span>&#160;<span class="comment"></span>    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l03010"></a><span class="lineno"> 3010</span>&#160;    <span class="keywordtype">int</span> Octree&lt; Degree &gt;::GetRoot( <span class="keyword">const</span> RootInfo&amp; ri , Real isoValue , TreeOctNode::ConstNeighborKey5&amp; neighborKey5 , <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> &amp; position , RootData&amp; rootData , <span class="keywordtype">int</span> sDepth , <span class="keyword">const</span> Real* metSolution , <span class="keywordtype">int</span> nonLinearFit )</div>
<div class="line"><a name="l03011"></a><span class="lineno"> 3011</span>&#160;    {</div>
<div class="line"><a name="l03012"></a><span class="lineno"> 3012</span>&#160;      <span class="keywordflow">if</span>( !MarchingCubes::HasRoots( ri.node-&gt;nodeData.mcIndex ) ) <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l03013"></a><span class="lineno"> 3013</span>&#160;      <span class="keywordtype">int</span> c1 , c2;</div>
<div class="line"><a name="l03014"></a><span class="lineno"> 3014</span>&#160;      Cube::EdgeCorners( ri.edgeIndex , c1 , c2 );</div>
<div class="line"><a name="l03015"></a><span class="lineno"> 3015</span>&#160;      <span class="keywordflow">if</span>( !MarchingCubes::HasEdgeRoots( ri.node-&gt;nodeData.mcIndex , ri.edgeIndex ) ) <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l03016"></a><span class="lineno"> 3016</span>&#160; </div>
<div class="line"><a name="l03017"></a><span class="lineno"> 3017</span>&#160;      <span class="keywordtype">long</span> <span class="keywordtype">long</span> key1 , key2;</div>
<div class="line"><a name="l03018"></a><span class="lineno"> 3018</span>&#160;      <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> n[2];</div>
<div class="line"><a name="l03019"></a><span class="lineno"> 3019</span>&#160; </div>
<div class="line"><a name="l03020"></a><span class="lineno"> 3020</span>&#160;      <span class="keywordtype">int</span> i , o , i1 , i2 , rCount=0;</div>
<div class="line"><a name="l03021"></a><span class="lineno"> 3021</span>&#160;      Polynomial&lt;2&gt; P;</div>
<div class="line"><a name="l03022"></a><span class="lineno"> 3022</span>&#160;      std::vector&lt; double &gt; roots;</div>
<div class="line"><a name="l03023"></a><span class="lineno"> 3023</span>&#160;      <span class="keywordtype">double</span> x0 , x1;</div>
<div class="line"><a name="l03024"></a><span class="lineno"> 3024</span>&#160;      Real center , width;</div>
<div class="line"><a name="l03025"></a><span class="lineno"> 3025</span>&#160;      Real averageRoot=0;</div>
<div class="line"><a name="l03026"></a><span class="lineno"> 3026</span>&#160;      Cube::FactorEdgeIndex( ri.edgeIndex , o , i1 , i2 );</div>
<div class="line"><a name="l03027"></a><span class="lineno"> 3027</span>&#160;      <span class="keywordtype">int</span> idx1[3] , idx2[3];</div>
<div class="line"><a name="l03028"></a><span class="lineno"> 3028</span>&#160;      key1 = VertexData::CornerIndex( ri.node , c1 , fData.depth , idx1 );</div>
<div class="line"><a name="l03029"></a><span class="lineno"> 3029</span>&#160;      key2 = VertexData::CornerIndex( ri.node , c2 , fData.depth , idx2 );</div>
<div class="line"><a name="l03030"></a><span class="lineno"> 3030</span>&#160; </div>
<div class="line"><a name="l03031"></a><span class="lineno"> 3031</span>&#160;      <span class="keywordtype">bool</span> isBoundary = ( IsBoundaryEdge( ri.node , ri.edgeIndex , sDepth )!=0 );</div>
<div class="line"><a name="l03032"></a><span class="lineno"> 3032</span>&#160;      <span class="keywordtype">bool</span> haveKey1 , haveKey2;</div>
<div class="line"><a name="l03033"></a><span class="lineno"> 3033</span>&#160;      std::pair&lt; Real , Point3D&lt; Real &gt; &gt; keyValue1 , keyValue2;</div>
<div class="line"><a name="l03034"></a><span class="lineno"> 3034</span>&#160;      <span class="keywordtype">int</span> iter1 , iter2;</div>
<div class="line"><a name="l03035"></a><span class="lineno"> 3035</span>&#160;      {</div>
<div class="line"><a name="l03036"></a><span class="lineno"> 3036</span>&#160;        iter1 = rootData.cornerIndices( ri.node )[ c1 ];</div>
<div class="line"><a name="l03037"></a><span class="lineno"> 3037</span>&#160;        iter2 = rootData.cornerIndices( ri.node )[ c2 ];</div>
<div class="line"><a name="l03038"></a><span class="lineno"> 3038</span>&#160;        keyValue1.first = rootData.cornerValues[iter1];</div>
<div class="line"><a name="l03039"></a><span class="lineno"> 3039</span>&#160;        keyValue2.first = rootData.cornerValues[iter2];</div>
<div class="line"><a name="l03040"></a><span class="lineno"> 3040</span>&#160;        <span class="keywordflow">if</span>( isBoundary )</div>
<div class="line"><a name="l03041"></a><span class="lineno"> 3041</span>&#160;        {</div>
<div class="line"><a name="l03042"></a><span class="lineno"> 3042</span>&#160;<span class="preprocessor">#pragma omp critical (normal_hash_access)</span></div>
<div class="line"><a name="l03043"></a><span class="lineno"> 3043</span>&#160;          {</div>
<div class="line"><a name="l03044"></a><span class="lineno"> 3044</span>&#160;            haveKey1 = ( rootData.boundaryValues-&gt;find( key1 )!=rootData.boundaryValues-&gt;end() );</div>
<div class="line"><a name="l03045"></a><span class="lineno"> 3045</span>&#160;            haveKey2 = ( rootData.boundaryValues-&gt;find( key2 )!=rootData.boundaryValues-&gt;end() );</div>
<div class="line"><a name="l03046"></a><span class="lineno"> 3046</span>&#160;            <span class="keywordflow">if</span>( haveKey1 ) keyValue1 = (*rootData.boundaryValues)[key1];</div>
<div class="line"><a name="l03047"></a><span class="lineno"> 3047</span>&#160;            <span class="keywordflow">if</span>( haveKey2 ) keyValue2 = (*rootData.boundaryValues)[key2];</div>
<div class="line"><a name="l03048"></a><span class="lineno"> 3048</span>&#160;          }</div>
<div class="line"><a name="l03049"></a><span class="lineno"> 3049</span>&#160;        }</div>
<div class="line"><a name="l03050"></a><span class="lineno"> 3050</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l03051"></a><span class="lineno"> 3051</span>&#160;        {</div>
<div class="line"><a name="l03052"></a><span class="lineno"> 3052</span>&#160;          haveKey1 = ( rootData.cornerNormalsSet[ iter1 ] != 0 );</div>
<div class="line"><a name="l03053"></a><span class="lineno"> 3053</span>&#160;          haveKey2 = ( rootData.cornerNormalsSet[ iter2 ] != 0 );</div>
<div class="line"><a name="l03054"></a><span class="lineno"> 3054</span>&#160;          keyValue1.first = rootData.cornerValues[iter1];</div>
<div class="line"><a name="l03055"></a><span class="lineno"> 3055</span>&#160;          keyValue2.first = rootData.cornerValues[iter2];</div>
<div class="line"><a name="l03056"></a><span class="lineno"> 3056</span>&#160;          <span class="keywordflow">if</span>( haveKey1 ) keyValue1.second = rootData.cornerNormals[iter1];</div>
<div class="line"><a name="l03057"></a><span class="lineno"> 3057</span>&#160;          <span class="keywordflow">if</span>( haveKey2 ) keyValue2.second = rootData.cornerNormals[iter2];</div>
<div class="line"><a name="l03058"></a><span class="lineno"> 3058</span>&#160;        }</div>
<div class="line"><a name="l03059"></a><span class="lineno"> 3059</span>&#160;      }</div>
<div class="line"><a name="l03060"></a><span class="lineno"> 3060</span>&#160;      <span class="keywordflow">if</span>( !haveKey1 || !haveKey2 ) neighborKey5.getNeighbors( ri.node );</div>
<div class="line"><a name="l03061"></a><span class="lineno"> 3061</span>&#160;      <span class="keywordflow">if</span>( !haveKey1 ) keyValue1.second = getCornerNormal( neighborKey5 , ri.node , c1 , metSolution );</div>
<div class="line"><a name="l03062"></a><span class="lineno"> 3062</span>&#160;      x0 = keyValue1.first;</div>
<div class="line"><a name="l03063"></a><span class="lineno"> 3063</span>&#160;      n[0] = keyValue1.second;</div>
<div class="line"><a name="l03064"></a><span class="lineno"> 3064</span>&#160; </div>
<div class="line"><a name="l03065"></a><span class="lineno"> 3065</span>&#160;      <span class="keywordflow">if</span>( !haveKey2 ) keyValue2.second = getCornerNormal( neighborKey5 , ri.node , c2 , metSolution );</div>
<div class="line"><a name="l03066"></a><span class="lineno"> 3066</span>&#160;      x1 = keyValue2.first;</div>
<div class="line"><a name="l03067"></a><span class="lineno"> 3067</span>&#160;      n[1] = keyValue2.second;</div>
<div class="line"><a name="l03068"></a><span class="lineno"> 3068</span>&#160; </div>
<div class="line"><a name="l03069"></a><span class="lineno"> 3069</span>&#160;      <span class="keywordflow">if</span>( !haveKey1 || !haveKey2 )</div>
<div class="line"><a name="l03070"></a><span class="lineno"> 3070</span>&#160;      {</div>
<div class="line"><a name="l03071"></a><span class="lineno"> 3071</span>&#160;        <span class="keywordflow">if</span>( isBoundary )</div>
<div class="line"><a name="l03072"></a><span class="lineno"> 3072</span>&#160;        {</div>
<div class="line"><a name="l03073"></a><span class="lineno"> 3073</span>&#160;<span class="preprocessor">#pragma omp critical (normal_hash_access)</span></div>
<div class="line"><a name="l03074"></a><span class="lineno"> 3074</span>&#160;          {</div>
<div class="line"><a name="l03075"></a><span class="lineno"> 3075</span>&#160;            <span class="keywordflow">if</span>( !haveKey1 ) (*rootData.boundaryValues)[key1] = keyValue1;</div>
<div class="line"><a name="l03076"></a><span class="lineno"> 3076</span>&#160;            <span class="keywordflow">if</span>( !haveKey2 ) (*rootData.boundaryValues)[key2] = keyValue2;</div>
<div class="line"><a name="l03077"></a><span class="lineno"> 3077</span>&#160;          }</div>
<div class="line"><a name="l03078"></a><span class="lineno"> 3078</span>&#160;        }</div>
<div class="line"><a name="l03079"></a><span class="lineno"> 3079</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l03080"></a><span class="lineno"> 3080</span>&#160;        {</div>
<div class="line"><a name="l03081"></a><span class="lineno"> 3081</span>&#160;          <span class="keywordflow">if</span>( !haveKey1 ) rootData.cornerNormals[iter1] = keyValue1.second , rootData.cornerNormalsSet[ iter1 ] = 1;</div>
<div class="line"><a name="l03082"></a><span class="lineno"> 3082</span>&#160;          <span class="keywordflow">if</span>( !haveKey2 ) rootData.cornerNormals[iter2] = keyValue2.second , rootData.cornerNormalsSet[ iter2 ] = 1;</div>
<div class="line"><a name="l03083"></a><span class="lineno"> 3083</span>&#160;        }</div>
<div class="line"><a name="l03084"></a><span class="lineno"> 3084</span>&#160;      }</div>
<div class="line"><a name="l03085"></a><span class="lineno"> 3085</span>&#160; </div>
<div class="line"><a name="l03086"></a><span class="lineno"> 3086</span>&#160;      <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> c;</div>
<div class="line"><a name="l03087"></a><span class="lineno"> 3087</span>&#160;      ri.node-&gt;centerAndWidth(c,width);</div>
<div class="line"><a name="l03088"></a><span class="lineno"> 3088</span>&#160;      center=c[o];</div>
<div class="line"><a name="l03089"></a><span class="lineno"> 3089</span>&#160;      <span class="keywordflow">for</span>( i=0 ; i&lt;DIMENSION ; i++ ) n[0][i] *= width , n[1][i] *= width;</div>
<div class="line"><a name="l03090"></a><span class="lineno"> 3090</span>&#160; </div>
<div class="line"><a name="l03091"></a><span class="lineno"> 3091</span>&#160;      <span class="keywordflow">switch</span>(o)</div>
<div class="line"><a name="l03092"></a><span class="lineno"> 3092</span>&#160;      {</div>
<div class="line"><a name="l03093"></a><span class="lineno"> 3093</span>&#160;      <span class="keywordflow">case</span> 0:</div>
<div class="line"><a name="l03094"></a><span class="lineno"> 3094</span>&#160;        position[1] = c[1]-width/2+width*i1;</div>
<div class="line"><a name="l03095"></a><span class="lineno"> 3095</span>&#160;        position[2] = c[2]-width/2+width*i2;</div>
<div class="line"><a name="l03096"></a><span class="lineno"> 3096</span>&#160;        <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l03097"></a><span class="lineno"> 3097</span>&#160;      <span class="keywordflow">case</span> 1:</div>
<div class="line"><a name="l03098"></a><span class="lineno"> 3098</span>&#160;        position[0] = c[0]-width/2+width*i1;</div>
<div class="line"><a name="l03099"></a><span class="lineno"> 3099</span>&#160;        position[2] = c[2]-width/2+width*i2;</div>
<div class="line"><a name="l03100"></a><span class="lineno"> 3100</span>&#160;        <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l03101"></a><span class="lineno"> 3101</span>&#160;      <span class="keywordflow">case</span> 2:</div>
<div class="line"><a name="l03102"></a><span class="lineno"> 3102</span>&#160;        position[0] = c[0]-width/2+width*i1;</div>
<div class="line"><a name="l03103"></a><span class="lineno"> 3103</span>&#160;        position[1] = c[1]-width/2+width*i2;</div>
<div class="line"><a name="l03104"></a><span class="lineno"> 3104</span>&#160;        <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l03105"></a><span class="lineno"> 3105</span>&#160;      }</div>
<div class="line"><a name="l03106"></a><span class="lineno"> 3106</span>&#160;      <span class="keywordtype">double</span> dx0,dx1;</div>
<div class="line"><a name="l03107"></a><span class="lineno"> 3107</span>&#160;      dx0 = n[0][o];</div>
<div class="line"><a name="l03108"></a><span class="lineno"> 3108</span>&#160;      dx1 = n[1][o];</div>
<div class="line"><a name="l03109"></a><span class="lineno"> 3109</span>&#160; </div>
<div class="line"><a name="l03110"></a><span class="lineno"> 3110</span>&#160;      <span class="comment">// The scaling will turn the Hermite Spline into a quadratic</span></div>
<div class="line"><a name="l03111"></a><span class="lineno"> 3111</span>&#160;      <span class="keywordtype">double</span> scl=(x1-x0)/((dx1+dx0)/2);</div>
<div class="line"><a name="l03112"></a><span class="lineno"> 3112</span>&#160;      dx0 *= scl;</div>
<div class="line"><a name="l03113"></a><span class="lineno"> 3113</span>&#160;      dx1 *= scl;</div>
<div class="line"><a name="l03114"></a><span class="lineno"> 3114</span>&#160; </div>
<div class="line"><a name="l03115"></a><span class="lineno"> 3115</span>&#160;      <span class="comment">// Hermite Spline</span></div>
<div class="line"><a name="l03116"></a><span class="lineno"> 3116</span>&#160;      P.coefficients[0] = x0;</div>
<div class="line"><a name="l03117"></a><span class="lineno"> 3117</span>&#160;      P.coefficients[1] = dx0;</div>
<div class="line"><a name="l03118"></a><span class="lineno"> 3118</span>&#160;      P.coefficients[2] = 3*(x1-x0)-dx1-2*dx0;</div>
<div class="line"><a name="l03119"></a><span class="lineno"> 3119</span>&#160; </div>
<div class="line"><a name="l03120"></a><span class="lineno"> 3120</span>&#160;      P.getSolutions( isoValue , roots , EPSILON );</div>
<div class="line"><a name="l03121"></a><span class="lineno"> 3121</span>&#160;      <span class="keywordflow">for</span>( i=0 ; i&lt;int(roots.size()) ; i++ )</div>
<div class="line"><a name="l03122"></a><span class="lineno"> 3122</span>&#160;        <span class="keywordflow">if</span>( roots[i]&gt;=0 &amp;&amp; roots[i]&lt;=1 )</div>
<div class="line"><a name="l03123"></a><span class="lineno"> 3123</span>&#160;        {</div>
<div class="line"><a name="l03124"></a><span class="lineno"> 3124</span>&#160;          averageRoot += Real( roots[i] );</div>
<div class="line"><a name="l03125"></a><span class="lineno"> 3125</span>&#160;          rCount++;</div>
<div class="line"><a name="l03126"></a><span class="lineno"> 3126</span>&#160;        }</div>
<div class="line"><a name="l03127"></a><span class="lineno"> 3127</span>&#160;      <span class="keywordflow">if</span>( rCount &amp;&amp; nonLinearFit ) averageRoot /= rCount;</div>
<div class="line"><a name="l03128"></a><span class="lineno"> 3128</span>&#160;      <span class="keywordflow">else</span>                       averageRoot  = Real((x0-isoValue)/(x0-x1));</div>
<div class="line"><a name="l03129"></a><span class="lineno"> 3129</span>&#160;      <span class="keywordflow">if</span>( averageRoot&lt;0 || averageRoot&gt;1 )</div>
<div class="line"><a name="l03130"></a><span class="lineno"> 3130</span>&#160;      {</div>
<div class="line"><a name="l03131"></a><span class="lineno"> 3131</span>&#160;        fprintf( stderr , <span class="stringliteral">&quot;[WARNING] Bad average root: %f\n&quot;</span> , averageRoot );</div>
<div class="line"><a name="l03132"></a><span class="lineno"> 3132</span>&#160;        fprintf( stderr , <span class="stringliteral">&quot;\t(%f %f) , (%f %f) (%f)\n&quot;</span> , x0 , x1 , dx0 , dx1 , isoValue );</div>
<div class="line"><a name="l03133"></a><span class="lineno"> 3133</span>&#160;        <span class="keywordflow">if</span>( averageRoot&lt;0 ) averageRoot = 0;</div>
<div class="line"><a name="l03134"></a><span class="lineno"> 3134</span>&#160;        <span class="keywordflow">if</span>( averageRoot&gt;1 ) averageRoot = 1;</div>
<div class="line"><a name="l03135"></a><span class="lineno"> 3135</span>&#160;      }</div>
<div class="line"><a name="l03136"></a><span class="lineno"> 3136</span>&#160;      position[o] = Real(center-width/2+width*averageRoot);</div>
<div class="line"><a name="l03137"></a><span class="lineno"> 3137</span>&#160;      <span class="keywordflow">return</span> 1;</div>
<div class="line"><a name="l03138"></a><span class="lineno"> 3138</span>&#160;    }</div>
<div class="line"><a name="l03139"></a><span class="lineno"> 3139</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l03140"></a><span class="lineno"> 3140</span>&#160;    <span class="keywordtype">int</span> Octree&lt; Degree &gt;::GetRootIndex( <span class="keyword">const</span> TreeOctNode* node , <span class="keywordtype">int</span> edgeIndex , <span class="keywordtype">int</span> maxDepth , <span class="keywordtype">int</span> sDepth,RootInfo&amp; ri )</div>
<div class="line"><a name="l03141"></a><span class="lineno"> 3141</span>&#160;    {</div>
<div class="line"><a name="l03142"></a><span class="lineno"> 3142</span>&#160;      <span class="keywordtype">int</span> c1,c2,f1,f2;</div>
<div class="line"><a name="l03143"></a><span class="lineno"> 3143</span>&#160;      <span class="keyword">const</span> TreeOctNode *temp,*finest;</div>
<div class="line"><a name="l03144"></a><span class="lineno"> 3144</span>&#160;      <span class="keywordtype">int</span> finestIndex;</div>
<div class="line"><a name="l03145"></a><span class="lineno"> 3145</span>&#160; </div>
<div class="line"><a name="l03146"></a><span class="lineno"> 3146</span>&#160;      Cube::FacesAdjacentToEdge(edgeIndex,f1,f2);</div>
<div class="line"><a name="l03147"></a><span class="lineno"> 3147</span>&#160; </div>
<div class="line"><a name="l03148"></a><span class="lineno"> 3148</span>&#160;      finest=node;</div>
<div class="line"><a name="l03149"></a><span class="lineno"> 3149</span>&#160;      finestIndex=edgeIndex;</div>
<div class="line"><a name="l03150"></a><span class="lineno"> 3150</span>&#160;      <span class="keywordflow">if</span>(node-&gt;depth()&lt;maxDepth){</div>
<div class="line"><a name="l03151"></a><span class="lineno"> 3151</span>&#160;        <span class="keywordflow">if</span>(IsBoundaryFace(node,f1,sDepth)){temp=NULL;}</div>
<div class="line"><a name="l03152"></a><span class="lineno"> 3152</span>&#160;        <span class="keywordflow">else</span>{temp=node-&gt;faceNeighbor(f1);}</div>
<div class="line"><a name="l03153"></a><span class="lineno"> 3153</span>&#160;        <span class="keywordflow">if</span>(temp &amp;&amp; temp-&gt;children){</div>
<div class="line"><a name="l03154"></a><span class="lineno"> 3154</span>&#160;          finest=temp;</div>
<div class="line"><a name="l03155"></a><span class="lineno"> 3155</span>&#160;          finestIndex=Cube::FaceReflectEdgeIndex(edgeIndex,f1);</div>
<div class="line"><a name="l03156"></a><span class="lineno"> 3156</span>&#160;        }</div>
<div class="line"><a name="l03157"></a><span class="lineno"> 3157</span>&#160;        <span class="keywordflow">else</span>{</div>
<div class="line"><a name="l03158"></a><span class="lineno"> 3158</span>&#160;          <span class="keywordflow">if</span>(IsBoundaryFace(node,f2,sDepth)){temp=NULL;}</div>
<div class="line"><a name="l03159"></a><span class="lineno"> 3159</span>&#160;          <span class="keywordflow">else</span>{temp=node-&gt;faceNeighbor(f2);}</div>
<div class="line"><a name="l03160"></a><span class="lineno"> 3160</span>&#160;          <span class="keywordflow">if</span>(temp &amp;&amp; temp-&gt;children){</div>
<div class="line"><a name="l03161"></a><span class="lineno"> 3161</span>&#160;            finest=temp;</div>
<div class="line"><a name="l03162"></a><span class="lineno"> 3162</span>&#160;            finestIndex=Cube::FaceReflectEdgeIndex(edgeIndex,f2);</div>
<div class="line"><a name="l03163"></a><span class="lineno"> 3163</span>&#160;          }</div>
<div class="line"><a name="l03164"></a><span class="lineno"> 3164</span>&#160;          <span class="keywordflow">else</span>{</div>
<div class="line"><a name="l03165"></a><span class="lineno"> 3165</span>&#160;            <span class="keywordflow">if</span>(IsBoundaryEdge(node,edgeIndex,sDepth)){temp=NULL;}</div>
<div class="line"><a name="l03166"></a><span class="lineno"> 3166</span>&#160;            <span class="keywordflow">else</span>{temp=node-&gt;edgeNeighbor(edgeIndex);}</div>
<div class="line"><a name="l03167"></a><span class="lineno"> 3167</span>&#160;            <span class="keywordflow">if</span>(temp &amp;&amp; temp-&gt;children){</div>
<div class="line"><a name="l03168"></a><span class="lineno"> 3168</span>&#160;              finest=temp;</div>
<div class="line"><a name="l03169"></a><span class="lineno"> 3169</span>&#160;              finestIndex=Cube::EdgeReflectEdgeIndex(edgeIndex);</div>
<div class="line"><a name="l03170"></a><span class="lineno"> 3170</span>&#160;            }</div>
<div class="line"><a name="l03171"></a><span class="lineno"> 3171</span>&#160;          }</div>
<div class="line"><a name="l03172"></a><span class="lineno"> 3172</span>&#160;        }</div>
<div class="line"><a name="l03173"></a><span class="lineno"> 3173</span>&#160;      }</div>
<div class="line"><a name="l03174"></a><span class="lineno"> 3174</span>&#160; </div>
<div class="line"><a name="l03175"></a><span class="lineno"> 3175</span>&#160;      Cube::EdgeCorners(finestIndex,c1,c2);</div>
<div class="line"><a name="l03176"></a><span class="lineno"> 3176</span>&#160;      <span class="keywordflow">if</span>(finest-&gt;children){</div>
<div class="line"><a name="l03177"></a><span class="lineno"> 3177</span>&#160;        <span class="keywordflow">if</span>      (GetRootIndex(&amp;finest-&gt;children[c1],finestIndex,maxDepth,sDepth,ri))    {<span class="keywordflow">return</span> 1;}</div>
<div class="line"><a name="l03178"></a><span class="lineno"> 3178</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (GetRootIndex(&amp;finest-&gt;children[c2],finestIndex,maxDepth,sDepth,ri))    {<span class="keywordflow">return</span> 1;}</div>
<div class="line"><a name="l03179"></a><span class="lineno"> 3179</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l03180"></a><span class="lineno"> 3180</span>&#160;        {</div>
<div class="line"><a name="l03181"></a><span class="lineno"> 3181</span>&#160;          fprintf( stderr , <span class="stringliteral">&quot;[WARNING] Couldn&#39;t find root index with either child\n&quot;</span> );</div>
<div class="line"><a name="l03182"></a><span class="lineno"> 3182</span>&#160;          <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l03183"></a><span class="lineno"> 3183</span>&#160;        }</div>
<div class="line"><a name="l03184"></a><span class="lineno"> 3184</span>&#160;      }</div>
<div class="line"><a name="l03185"></a><span class="lineno"> 3185</span>&#160;      <span class="keywordflow">else</span></div>
<div class="line"><a name="l03186"></a><span class="lineno"> 3186</span>&#160;      {</div>
<div class="line"><a name="l03187"></a><span class="lineno"> 3187</span>&#160;        <span class="keywordflow">if</span>( !(MarchingCubes::edgeMask()[finest-&gt;nodeData.mcIndex] &amp; (1&lt;&lt;finestIndex)) )</div>
<div class="line"><a name="l03188"></a><span class="lineno"> 3188</span>&#160;        {</div>
<div class="line"><a name="l03189"></a><span class="lineno"> 3189</span>&#160;          fprintf( stderr , <span class="stringliteral">&quot;[WARNING] Finest node does not have iso-edge\n&quot;</span> );</div>
<div class="line"><a name="l03190"></a><span class="lineno"> 3190</span>&#160;          <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l03191"></a><span class="lineno"> 3191</span>&#160;        }</div>
<div class="line"><a name="l03192"></a><span class="lineno"> 3192</span>&#160; </div>
<div class="line"><a name="l03193"></a><span class="lineno"> 3193</span>&#160;        <span class="keywordtype">int</span> o,i1,i2;</div>
<div class="line"><a name="l03194"></a><span class="lineno"> 3194</span>&#160;        Cube::FactorEdgeIndex(finestIndex,o,i1,i2);</div>
<div class="line"><a name="l03195"></a><span class="lineno"> 3195</span>&#160;        <span class="keywordtype">int</span> d,off[3];</div>
<div class="line"><a name="l03196"></a><span class="lineno"> 3196</span>&#160;        finest-&gt;depthAndOffset(d,off);</div>
<div class="line"><a name="l03197"></a><span class="lineno"> 3197</span>&#160;        ri.node=finest;</div>
<div class="line"><a name="l03198"></a><span class="lineno"> 3198</span>&#160;        ri.edgeIndex=finestIndex;</div>
<div class="line"><a name="l03199"></a><span class="lineno"> 3199</span>&#160;        <span class="keywordtype">int</span> eIndex[2],offset;</div>
<div class="line"><a name="l03200"></a><span class="lineno"> 3200</span>&#160;        offset=BinaryNode&lt;Real&gt;::Index( d , off[o] );</div>
<div class="line"><a name="l03201"></a><span class="lineno"> 3201</span>&#160;        <span class="keywordflow">switch</span>(o)</div>
<div class="line"><a name="l03202"></a><span class="lineno"> 3202</span>&#160;        {</div>
<div class="line"><a name="l03203"></a><span class="lineno"> 3203</span>&#160;        <span class="keywordflow">case</span> 0:</div>
<div class="line"><a name="l03204"></a><span class="lineno"> 3204</span>&#160;          eIndex[0]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,off[1],i1);</div>
<div class="line"><a name="l03205"></a><span class="lineno"> 3205</span>&#160;          eIndex[1]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,off[2],i2);</div>
<div class="line"><a name="l03206"></a><span class="lineno"> 3206</span>&#160;          <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l03207"></a><span class="lineno"> 3207</span>&#160;        <span class="keywordflow">case</span> 1:</div>
<div class="line"><a name="l03208"></a><span class="lineno"> 3208</span>&#160;          eIndex[0]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,off[0],i1);</div>
<div class="line"><a name="l03209"></a><span class="lineno"> 3209</span>&#160;          eIndex[1]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,off[2],i2);</div>
<div class="line"><a name="l03210"></a><span class="lineno"> 3210</span>&#160;          <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l03211"></a><span class="lineno"> 3211</span>&#160;        <span class="keywordflow">case</span> 2:</div>
<div class="line"><a name="l03212"></a><span class="lineno"> 3212</span>&#160;          eIndex[0]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,off[0],i1);</div>
<div class="line"><a name="l03213"></a><span class="lineno"> 3213</span>&#160;          eIndex[1]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,off[1],i2);</div>
<div class="line"><a name="l03214"></a><span class="lineno"> 3214</span>&#160;          <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l03215"></a><span class="lineno"> 3215</span>&#160;        }</div>
<div class="line"><a name="l03216"></a><span class="lineno"> 3216</span>&#160;        ri.key = (<span class="keywordtype">long</span> long)(o) | (<span class="keywordtype">long</span> long)(eIndex[0])&lt;&lt;5 | (<span class="keywordtype">long</span> long)(eIndex[1])&lt;&lt;25 | (<span class="keywordtype">long</span> long)(offset)&lt;&lt;45;</div>
<div class="line"><a name="l03217"></a><span class="lineno"> 3217</span>&#160;        <span class="keywordflow">return</span> 1;</div>
<div class="line"><a name="l03218"></a><span class="lineno"> 3218</span>&#160;      }</div>
<div class="line"><a name="l03219"></a><span class="lineno"> 3219</span>&#160;    }</div>
<div class="line"><a name="l03220"></a><span class="lineno"> 3220</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l03221"></a><span class="lineno"> 3221</span>&#160;    <span class="keywordtype">int</span> Octree&lt;Degree&gt;::GetRootIndex( <span class="keyword">const</span> TreeOctNode* node , <span class="keywordtype">int</span> edgeIndex , <span class="keywordtype">int</span> maxDepth , RootInfo&amp; ri )</div>
<div class="line"><a name="l03222"></a><span class="lineno"> 3222</span>&#160;    {</div>
<div class="line"><a name="l03223"></a><span class="lineno"> 3223</span>&#160;      <span class="keywordtype">int</span> c1,c2,f1,f2;</div>
<div class="line"><a name="l03224"></a><span class="lineno"> 3224</span>&#160;      <span class="keyword">const</span> TreeOctNode *temp,*finest;</div>
<div class="line"><a name="l03225"></a><span class="lineno"> 3225</span>&#160;      <span class="keywordtype">int</span> finestIndex;</div>
<div class="line"><a name="l03226"></a><span class="lineno"> 3226</span>&#160; </div>
<div class="line"><a name="l03227"></a><span class="lineno"> 3227</span>&#160; </div>
<div class="line"><a name="l03228"></a><span class="lineno"> 3228</span>&#160;      <span class="comment">// The assumption is that the super-edge has a root along it.</span></div>
<div class="line"><a name="l03229"></a><span class="lineno"> 3229</span>&#160;      <span class="keywordflow">if</span>(!(MarchingCubes::edgeMask()[node-&gt;nodeData.mcIndex] &amp; (1&lt;&lt;edgeIndex))){<span class="keywordflow">return</span> 0;}</div>
<div class="line"><a name="l03230"></a><span class="lineno"> 3230</span>&#160; </div>
<div class="line"><a name="l03231"></a><span class="lineno"> 3231</span>&#160;      Cube::FacesAdjacentToEdge(edgeIndex,f1,f2);</div>
<div class="line"><a name="l03232"></a><span class="lineno"> 3232</span>&#160; </div>
<div class="line"><a name="l03233"></a><span class="lineno"> 3233</span>&#160;      finest = node;</div>
<div class="line"><a name="l03234"></a><span class="lineno"> 3234</span>&#160;      finestIndex = edgeIndex;</div>
<div class="line"><a name="l03235"></a><span class="lineno"> 3235</span>&#160;      <span class="keywordflow">if</span>( node-&gt;depth()&lt;maxDepth &amp;&amp; !node-&gt;children )</div>
<div class="line"><a name="l03236"></a><span class="lineno"> 3236</span>&#160;      {</div>
<div class="line"><a name="l03237"></a><span class="lineno"> 3237</span>&#160;        temp=node-&gt;faceNeighbor( f1 );</div>
<div class="line"><a name="l03238"></a><span class="lineno"> 3238</span>&#160;        <span class="keywordflow">if</span>( temp &amp;&amp; temp-&gt;children ) finest = temp , finestIndex = Cube::FaceReflectEdgeIndex( edgeIndex , f1 );</div>
<div class="line"><a name="l03239"></a><span class="lineno"> 3239</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l03240"></a><span class="lineno"> 3240</span>&#160;        {</div>
<div class="line"><a name="l03241"></a><span class="lineno"> 3241</span>&#160;          temp = node-&gt;faceNeighbor( f2 );</div>
<div class="line"><a name="l03242"></a><span class="lineno"> 3242</span>&#160;          <span class="keywordflow">if</span>( temp &amp;&amp; temp-&gt;children ) finest = temp , finestIndex = Cube::FaceReflectEdgeIndex( edgeIndex , f2 );</div>
<div class="line"><a name="l03243"></a><span class="lineno"> 3243</span>&#160;          <span class="keywordflow">else</span></div>
<div class="line"><a name="l03244"></a><span class="lineno"> 3244</span>&#160;          {</div>
<div class="line"><a name="l03245"></a><span class="lineno"> 3245</span>&#160;            temp = node-&gt;edgeNeighbor( edgeIndex );</div>
<div class="line"><a name="l03246"></a><span class="lineno"> 3246</span>&#160;            <span class="keywordflow">if</span>( temp &amp;&amp; temp-&gt;children ) finest = temp , finestIndex = Cube::EdgeReflectEdgeIndex( edgeIndex );</div>
<div class="line"><a name="l03247"></a><span class="lineno"> 3247</span>&#160;          }</div>
<div class="line"><a name="l03248"></a><span class="lineno"> 3248</span>&#160;        }</div>
<div class="line"><a name="l03249"></a><span class="lineno"> 3249</span>&#160;      }</div>
<div class="line"><a name="l03250"></a><span class="lineno"> 3250</span>&#160; </div>
<div class="line"><a name="l03251"></a><span class="lineno"> 3251</span>&#160;      Cube::EdgeCorners( finestIndex , c1 , c2 );</div>
<div class="line"><a name="l03252"></a><span class="lineno"> 3252</span>&#160;      <span class="keywordflow">if</span>( finest-&gt;children )</div>
<div class="line"><a name="l03253"></a><span class="lineno"> 3253</span>&#160;      {</div>
<div class="line"><a name="l03254"></a><span class="lineno"> 3254</span>&#160;        <span class="keywordflow">if</span>     ( GetRootIndex( finest-&gt;children + c1 , finestIndex , maxDepth , ri ) ) <span class="keywordflow">return</span> 1;</div>
<div class="line"><a name="l03255"></a><span class="lineno"> 3255</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span>( GetRootIndex( finest-&gt;children + c2 , finestIndex , maxDepth , ri ) ) <span class="keywordflow">return</span> 1;</div>
<div class="line"><a name="l03256"></a><span class="lineno"> 3256</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l03257"></a><span class="lineno"> 3257</span>&#160;        {</div>
<div class="line"><a name="l03258"></a><span class="lineno"> 3258</span>&#160;          <span class="keywordtype">int</span> d1 , off1[3] , d2 , off2[3];</div>
<div class="line"><a name="l03259"></a><span class="lineno"> 3259</span>&#160;          node-&gt;depthAndOffset( d1 , off1 );</div>
<div class="line"><a name="l03260"></a><span class="lineno"> 3260</span>&#160;          finest-&gt;depthAndOffset( d2 , off2 );</div>
<div class="line"><a name="l03261"></a><span class="lineno"> 3261</span>&#160;          fprintf( stderr , <span class="stringliteral">&quot;[WARNING] Couldn&#39;t find root index with either child [%d] (%d %d %d) -&gt; [%d] (%d %d %d) (%d %d)\n&quot;</span> , d1 , off1[0] , off1[1] , off1[2] , d2 , off2[0] , off2[1] , off2[2] , node-&gt;children!=NULL , finest-&gt;children!=NULL );</div>
<div class="line"><a name="l03262"></a><span class="lineno"> 3262</span>&#160;          printf( <span class="stringliteral">&quot;\t&quot;</span> );</div>
<div class="line"><a name="l03263"></a><span class="lineno"> 3263</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;8 ; i++ ) <span class="keywordflow">if</span>( node-&gt;nodeData.mcIndex &amp; (1&lt;&lt;i) ) printf( <span class="stringliteral">&quot;1&quot;</span> ); <span class="keywordflow">else</span> printf( <span class="stringliteral">&quot;0&quot;</span> );</div>
<div class="line"><a name="l03264"></a><span class="lineno"> 3264</span>&#160;          printf( <span class="stringliteral">&quot;\t&quot;</span> );</div>
<div class="line"><a name="l03265"></a><span class="lineno"> 3265</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;8 ; i++ ) <span class="keywordflow">if</span>( finest-&gt;nodeData.mcIndex &amp; (1&lt;&lt;i) ) printf( <span class="stringliteral">&quot;1&quot;</span> ); <span class="keywordflow">else</span> printf( <span class="stringliteral">&quot;0&quot;</span> );</div>
<div class="line"><a name="l03266"></a><span class="lineno"> 3266</span>&#160;          printf( <span class="stringliteral">&quot;\n&quot;</span> );</div>
<div class="line"><a name="l03267"></a><span class="lineno"> 3267</span>&#160;          <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l03268"></a><span class="lineno"> 3268</span>&#160;        }</div>
<div class="line"><a name="l03269"></a><span class="lineno"> 3269</span>&#160;      }</div>
<div class="line"><a name="l03270"></a><span class="lineno"> 3270</span>&#160;      <span class="keywordflow">else</span></div>
<div class="line"><a name="l03271"></a><span class="lineno"> 3271</span>&#160;      {</div>
<div class="line"><a name="l03272"></a><span class="lineno"> 3272</span>&#160;        <span class="keywordtype">int</span> o,i1,i2;</div>
<div class="line"><a name="l03273"></a><span class="lineno"> 3273</span>&#160;        Cube::FactorEdgeIndex(finestIndex,o,i1,i2);</div>
<div class="line"><a name="l03274"></a><span class="lineno"> 3274</span>&#160;        <span class="keywordtype">int</span> d,off[3];</div>
<div class="line"><a name="l03275"></a><span class="lineno"> 3275</span>&#160;        finest-&gt;depthAndOffset(d,off);</div>
<div class="line"><a name="l03276"></a><span class="lineno"> 3276</span>&#160;        ri.node=finest;</div>
<div class="line"><a name="l03277"></a><span class="lineno"> 3277</span>&#160;        ri.edgeIndex=finestIndex;</div>
<div class="line"><a name="l03278"></a><span class="lineno"> 3278</span>&#160;        <span class="keywordtype">int</span> offset,eIndex[2];</div>
<div class="line"><a name="l03279"></a><span class="lineno"> 3279</span>&#160;        offset = BinaryNode&lt; Real &gt;::CenterIndex( d , off[o] );</div>
<div class="line"><a name="l03280"></a><span class="lineno"> 3280</span>&#160;        <span class="keywordflow">switch</span>(o){</div>
<div class="line"><a name="l03281"></a><span class="lineno"> 3281</span>&#160;        <span class="keywordflow">case</span> 0:</div>
<div class="line"><a name="l03282"></a><span class="lineno"> 3282</span>&#160;          eIndex[0]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,off[1],i1);</div>
<div class="line"><a name="l03283"></a><span class="lineno"> 3283</span>&#160;          eIndex[1]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,off[2],i2);</div>
<div class="line"><a name="l03284"></a><span class="lineno"> 3284</span>&#160;          <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l03285"></a><span class="lineno"> 3285</span>&#160;        <span class="keywordflow">case</span> 1:</div>
<div class="line"><a name="l03286"></a><span class="lineno"> 3286</span>&#160;          eIndex[0]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,off[0],i1);</div>
<div class="line"><a name="l03287"></a><span class="lineno"> 3287</span>&#160;          eIndex[1]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,off[2],i2);</div>
<div class="line"><a name="l03288"></a><span class="lineno"> 3288</span>&#160;          <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l03289"></a><span class="lineno"> 3289</span>&#160;        <span class="keywordflow">case</span> 2:</div>
<div class="line"><a name="l03290"></a><span class="lineno"> 3290</span>&#160;          eIndex[0]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,off[0],i1);</div>
<div class="line"><a name="l03291"></a><span class="lineno"> 3291</span>&#160;          eIndex[1]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,off[1],i2);</div>
<div class="line"><a name="l03292"></a><span class="lineno"> 3292</span>&#160;          <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l03293"></a><span class="lineno"> 3293</span>&#160;        }</div>
<div class="line"><a name="l03294"></a><span class="lineno"> 3294</span>&#160;        ri.key= (<span class="keywordtype">long</span> long)(o) | (<span class="keywordtype">long</span> long)(eIndex[0])&lt;&lt;5 | (<span class="keywordtype">long</span> long)(eIndex[1])&lt;&lt;25 | (<span class="keywordtype">long</span> long)(offset)&lt;&lt;45;</div>
<div class="line"><a name="l03295"></a><span class="lineno"> 3295</span>&#160;        <span class="keywordflow">return</span> 1;</div>
<div class="line"><a name="l03296"></a><span class="lineno"> 3296</span>&#160;      }</div>
<div class="line"><a name="l03297"></a><span class="lineno"> 3297</span>&#160;    }</div>
<div class="line"><a name="l03298"></a><span class="lineno"> 3298</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l03299"></a><span class="lineno"> 3299</span>&#160;    <span class="keywordtype">int</span> Octree&lt;Degree&gt;::GetRootPair(<span class="keyword">const</span> RootInfo&amp; ri,<span class="keywordtype">int</span> maxDepth,RootInfo&amp; pair){</div>
<div class="line"><a name="l03300"></a><span class="lineno"> 3300</span>&#160;      <span class="keyword">const</span> TreeOctNode* node=ri.node;</div>
<div class="line"><a name="l03301"></a><span class="lineno"> 3301</span>&#160;      <span class="keywordtype">int</span> c1,c2,c;</div>
<div class="line"><a name="l03302"></a><span class="lineno"> 3302</span>&#160;      Cube::EdgeCorners(ri.edgeIndex,c1,c2);</div>
<div class="line"><a name="l03303"></a><span class="lineno"> 3303</span>&#160;      <span class="keywordflow">while</span>(node-&gt;parent){</div>
<div class="line"><a name="l03304"></a><span class="lineno"> 3304</span>&#160;        c=int(node-node-&gt;parent-&gt;children);</div>
<div class="line"><a name="l03305"></a><span class="lineno"> 3305</span>&#160;        <span class="keywordflow">if</span>(c!=c1 &amp;&amp; c!=c2){<span class="keywordflow">return</span> 0;}</div>
<div class="line"><a name="l03306"></a><span class="lineno"> 3306</span>&#160;        <span class="keywordflow">if</span>(!MarchingCubes::HasEdgeRoots(node-&gt;parent-&gt;nodeData.mcIndex,ri.edgeIndex)){</div>
<div class="line"><a name="l03307"></a><span class="lineno"> 3307</span>&#160;          <span class="keywordflow">if</span>(c==c1){<span class="keywordflow">return</span> GetRootIndex(&amp;node-&gt;parent-&gt;children[c2],ri.edgeIndex,maxDepth,pair);}</div>
<div class="line"><a name="l03308"></a><span class="lineno"> 3308</span>&#160;          <span class="keywordflow">else</span>{<span class="keywordflow">return</span> GetRootIndex(&amp;node-&gt;parent-&gt;children[c1],ri.edgeIndex,maxDepth,pair);}</div>
<div class="line"><a name="l03309"></a><span class="lineno"> 3309</span>&#160;        }</div>
<div class="line"><a name="l03310"></a><span class="lineno"> 3310</span>&#160;        node=node-&gt;parent;</div>
<div class="line"><a name="l03311"></a><span class="lineno"> 3311</span>&#160;      }</div>
<div class="line"><a name="l03312"></a><span class="lineno"> 3312</span>&#160;      <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l03313"></a><span class="lineno"> 3313</span>&#160; </div>
<div class="line"><a name="l03314"></a><span class="lineno"> 3314</span>&#160;    }</div>
<div class="line"><a name="l03315"></a><span class="lineno"> 3315</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l03316"></a><span class="lineno"> 3316</span>&#160;    <span class="keywordtype">int</span> Octree&lt; Degree &gt;::GetRootIndex( <span class="keyword">const</span> RootInfo&amp; ri , RootData&amp; rootData , CoredPointIndex&amp; index )</div>
<div class="line"><a name="l03317"></a><span class="lineno"> 3317</span>&#160;    {</div>
<div class="line"><a name="l03318"></a><span class="lineno"> 3318</span>&#160;      <span class="keywordtype">long</span> <span class="keywordtype">long</span> key = ri.key;</div>
<div class="line"><a name="l03319"></a><span class="lineno"> 3319</span>&#160;      hash_map&lt; long long , int &gt;::iterator rootIter;</div>
<div class="line"><a name="l03320"></a><span class="lineno"> 3320</span>&#160;      rootIter = rootData.boundaryRoots.find( key );</div>
<div class="line"><a name="l03321"></a><span class="lineno"> 3321</span>&#160;      <span class="keywordflow">if</span>( rootIter!=rootData.boundaryRoots.end() )</div>
<div class="line"><a name="l03322"></a><span class="lineno"> 3322</span>&#160;      {</div>
<div class="line"><a name="l03323"></a><span class="lineno"> 3323</span>&#160;        index.inCore = 1;</div>
<div class="line"><a name="l03324"></a><span class="lineno"> 3324</span>&#160;        index.index = rootIter-&gt;second;</div>
<div class="line"><a name="l03325"></a><span class="lineno"> 3325</span>&#160;        <span class="keywordflow">return</span> 1;</div>
<div class="line"><a name="l03326"></a><span class="lineno"> 3326</span>&#160;      }</div>
<div class="line"><a name="l03327"></a><span class="lineno"> 3327</span>&#160;      <span class="keywordflow">else</span> <span class="keywordflow">if</span>( rootData.interiorRoots )</div>
<div class="line"><a name="l03328"></a><span class="lineno"> 3328</span>&#160;      {</div>
<div class="line"><a name="l03329"></a><span class="lineno"> 3329</span>&#160;        <span class="keywordtype">int</span> eIndex = rootData.edgeIndices( ri.node )[ ri.edgeIndex ];</div>
<div class="line"><a name="l03330"></a><span class="lineno"> 3330</span>&#160;        <span class="keywordflow">if</span>( rootData.edgesSet[ eIndex ] )</div>
<div class="line"><a name="l03331"></a><span class="lineno"> 3331</span>&#160;        {</div>
<div class="line"><a name="l03332"></a><span class="lineno"> 3332</span>&#160;          index.inCore = 0;</div>
<div class="line"><a name="l03333"></a><span class="lineno"> 3333</span>&#160;          index.index = rootData.interiorRoots[ eIndex ];</div>
<div class="line"><a name="l03334"></a><span class="lineno"> 3334</span>&#160;          <span class="keywordflow">return</span> 1;</div>
<div class="line"><a name="l03335"></a><span class="lineno"> 3335</span>&#160;        }</div>
<div class="line"><a name="l03336"></a><span class="lineno"> 3336</span>&#160;      }</div>
<div class="line"><a name="l03337"></a><span class="lineno"> 3337</span>&#160;      <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l03338"></a><span class="lineno"> 3338</span>&#160;    }</div>
<div class="line"><a name="l03339"></a><span class="lineno"> 3339</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l03340"></a><span class="lineno"> 3340</span>&#160;    <span class="keywordtype">int</span> Octree&lt; Degree &gt;::SetMCRootPositions( TreeOctNode* node , <span class="keywordtype">int</span> sDepth , Real isoValue , TreeOctNode::ConstNeighborKey5&amp; neighborKey5 , RootData&amp; rootData ,</div>
<div class="line"><a name="l03341"></a><span class="lineno"> 3341</span>&#160;                                              std::vector&lt; <a class="code" href="structpcl_1_1poisson_1_1_point3_d.html">Point3D&lt; float &gt;</a> &gt;* interiorPositions , CoredMeshData* mesh , <span class="keyword">const</span> Real* metSolution , <span class="keywordtype">int</span> nonLinearFit )</div>
<div class="line"><a name="l03342"></a><span class="lineno"> 3342</span>&#160;    {</div>
<div class="line"><a name="l03343"></a><span class="lineno"> 3343</span>&#160;      <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> position;</div>
<div class="line"><a name="l03344"></a><span class="lineno"> 3344</span>&#160;      <span class="keywordtype">int</span> eIndex;</div>
<div class="line"><a name="l03345"></a><span class="lineno"> 3345</span>&#160;      RootInfo ri;</div>
<div class="line"><a name="l03346"></a><span class="lineno"> 3346</span>&#160;      <span class="keywordtype">int</span> count=0;</div>
<div class="line"><a name="l03347"></a><span class="lineno"> 3347</span>&#160;      <span class="keywordflow">if</span>( !MarchingCubes::HasRoots( node-&gt;nodeData.mcIndex ) ) <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l03348"></a><span class="lineno"> 3348</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;DIMENSION ; i++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=0 ; j&lt;2 ; j++ ) <span class="keywordflow">for</span>( <span class="keywordtype">int</span> k=0 ; k&lt;2 ; k++ )</div>
<div class="line"><a name="l03349"></a><span class="lineno"> 3349</span>&#160;      {</div>
<div class="line"><a name="l03350"></a><span class="lineno"> 3350</span>&#160;        <span class="keywordtype">long</span> <span class="keywordtype">long</span> key;</div>
<div class="line"><a name="l03351"></a><span class="lineno"> 3351</span>&#160;        eIndex = Cube::EdgeIndex( i , j , k );</div>
<div class="line"><a name="l03352"></a><span class="lineno"> 3352</span>&#160;        <span class="keywordflow">if</span>( GetRootIndex( node , eIndex , fData.depth , ri ) )</div>
<div class="line"><a name="l03353"></a><span class="lineno"> 3353</span>&#160;        {</div>
<div class="line"><a name="l03354"></a><span class="lineno"> 3354</span>&#160;          key = ri.key;</div>
<div class="line"><a name="l03355"></a><span class="lineno"> 3355</span>&#160;          <span class="keywordflow">if</span>( !rootData.interiorRoots || IsBoundaryEdge( node , i , j , k , sDepth ) )</div>
<div class="line"><a name="l03356"></a><span class="lineno"> 3356</span>&#160;          {</div>
<div class="line"><a name="l03357"></a><span class="lineno"> 3357</span>&#160;            poisson::hash_map&lt; long long , int &gt;::iterator iter , end;</div>
<div class="line"><a name="l03358"></a><span class="lineno"> 3358</span>&#160;            <span class="comment">// Check if the root has already been set</span></div>
<div class="line"><a name="l03359"></a><span class="lineno"> 3359</span>&#160;<span class="preprocessor">#pragma omp critical (boundary_roots_hash_access)</span></div>
<div class="line"><a name="l03360"></a><span class="lineno"> 3360</span>&#160;            {</div>
<div class="line"><a name="l03361"></a><span class="lineno"> 3361</span>&#160;              iter = rootData.boundaryRoots.find( key );</div>
<div class="line"><a name="l03362"></a><span class="lineno"> 3362</span>&#160;              end  = rootData.boundaryRoots.end();</div>
<div class="line"><a name="l03363"></a><span class="lineno"> 3363</span>&#160;            }</div>
<div class="line"><a name="l03364"></a><span class="lineno"> 3364</span>&#160;            <span class="keywordflow">if</span>( iter==end )</div>
<div class="line"><a name="l03365"></a><span class="lineno"> 3365</span>&#160;            {</div>
<div class="line"><a name="l03366"></a><span class="lineno"> 3366</span>&#160;              <span class="comment">// Get the root information</span></div>
<div class="line"><a name="l03367"></a><span class="lineno"> 3367</span>&#160;              GetRoot( ri , isoValue , neighborKey5 , position , rootData , sDepth , metSolution , nonLinearFit );</div>
<div class="line"><a name="l03368"></a><span class="lineno"> 3368</span>&#160;              <span class="comment">// Add the root if it hasn&#39;t been added already</span></div>
<div class="line"><a name="l03369"></a><span class="lineno"> 3369</span>&#160;<span class="preprocessor">#pragma omp critical (boundary_roots_hash_access)</span></div>
<div class="line"><a name="l03370"></a><span class="lineno"> 3370</span>&#160;              {</div>
<div class="line"><a name="l03371"></a><span class="lineno"> 3371</span>&#160;                iter = rootData.boundaryRoots.find( key );</div>
<div class="line"><a name="l03372"></a><span class="lineno"> 3372</span>&#160;                end  = rootData.boundaryRoots.end();</div>
<div class="line"><a name="l03373"></a><span class="lineno"> 3373</span>&#160;                <span class="keywordflow">if</span>( iter==end )</div>
<div class="line"><a name="l03374"></a><span class="lineno"> 3374</span>&#160;                {</div>
<div class="line"><a name="l03375"></a><span class="lineno"> 3375</span>&#160;                  mesh-&gt;inCorePoints.push_back( position );</div>
<div class="line"><a name="l03376"></a><span class="lineno"> 3376</span>&#160;                  rootData.boundaryRoots[key] = int( mesh-&gt;inCorePoints.size() ) - 1;</div>
<div class="line"><a name="l03377"></a><span class="lineno"> 3377</span>&#160;                }</div>
<div class="line"><a name="l03378"></a><span class="lineno"> 3378</span>&#160;              }</div>
<div class="line"><a name="l03379"></a><span class="lineno"> 3379</span>&#160;              <span class="keywordflow">if</span>( iter==end ) count++;</div>
<div class="line"><a name="l03380"></a><span class="lineno"> 3380</span>&#160;            }</div>
<div class="line"><a name="l03381"></a><span class="lineno"> 3381</span>&#160;          }</div>
<div class="line"><a name="l03382"></a><span class="lineno"> 3382</span>&#160;          <span class="keywordflow">else</span></div>
<div class="line"><a name="l03383"></a><span class="lineno"> 3383</span>&#160;          {</div>
<div class="line"><a name="l03384"></a><span class="lineno"> 3384</span>&#160;            <span class="keywordtype">int</span> nodeEdgeIndex = rootData.edgeIndices( ri.node )[ ri.edgeIndex ];</div>
<div class="line"><a name="l03385"></a><span class="lineno"> 3385</span>&#160;            <span class="keywordflow">if</span>( !rootData.edgesSet[ nodeEdgeIndex ] )</div>
<div class="line"><a name="l03386"></a><span class="lineno"> 3386</span>&#160;            {</div>
<div class="line"><a name="l03387"></a><span class="lineno"> 3387</span>&#160;              <span class="comment">// Get the root information</span></div>
<div class="line"><a name="l03388"></a><span class="lineno"> 3388</span>&#160;              GetRoot( ri , isoValue , neighborKey5 , position , rootData , sDepth , metSolution , nonLinearFit );</div>
<div class="line"><a name="l03389"></a><span class="lineno"> 3389</span>&#160;              <span class="comment">// Add the root if it hasn&#39;t been added already</span></div>
<div class="line"><a name="l03390"></a><span class="lineno"> 3390</span>&#160;<span class="preprocessor">#pragma omp critical (add_point_access)</span></div>
<div class="line"><a name="l03391"></a><span class="lineno"> 3391</span>&#160;              {</div>
<div class="line"><a name="l03392"></a><span class="lineno"> 3392</span>&#160;                <span class="keywordflow">if</span>( !rootData.edgesSet[ nodeEdgeIndex ] )</div>
<div class="line"><a name="l03393"></a><span class="lineno"> 3393</span>&#160;                {</div>
<div class="line"><a name="l03394"></a><span class="lineno"> 3394</span>&#160;                  rootData.interiorRoots[ nodeEdgeIndex ] = mesh-&gt;addOutOfCorePoint( position );</div>
<div class="line"><a name="l03395"></a><span class="lineno"> 3395</span>&#160;                  interiorPositions-&gt;push_back( position );</div>
<div class="line"><a name="l03396"></a><span class="lineno"> 3396</span>&#160;                  rootData.edgesSet[ nodeEdgeIndex ] = 1;</div>
<div class="line"><a name="l03397"></a><span class="lineno"> 3397</span>&#160;                  count++;</div>
<div class="line"><a name="l03398"></a><span class="lineno"> 3398</span>&#160;                }</div>
<div class="line"><a name="l03399"></a><span class="lineno"> 3399</span>&#160;              }</div>
<div class="line"><a name="l03400"></a><span class="lineno"> 3400</span>&#160;            }</div>
<div class="line"><a name="l03401"></a><span class="lineno"> 3401</span>&#160;          }</div>
<div class="line"><a name="l03402"></a><span class="lineno"> 3402</span>&#160;        }</div>
<div class="line"><a name="l03403"></a><span class="lineno"> 3403</span>&#160;      }</div>
<div class="line"><a name="l03404"></a><span class="lineno"> 3404</span>&#160;      <span class="keywordflow">return</span> count;</div>
<div class="line"><a name="l03405"></a><span class="lineno"> 3405</span>&#160;    }</div>
<div class="line"><a name="l03406"></a><span class="lineno"> 3406</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l03407"></a><span class="lineno"> 3407</span>&#160;    <span class="keywordtype">int</span> Octree&lt; Degree &gt;::SetBoundaryMCRootPositions( <span class="keywordtype">int</span> sDepth , Real isoValue , RootData&amp; rootData , CoredMeshData* mesh , <span class="keywordtype">int</span> nonLinearFit )</div>
<div class="line"><a name="l03408"></a><span class="lineno"> 3408</span>&#160;    {</div>
<div class="line"><a name="l03409"></a><span class="lineno"> 3409</span>&#160;      <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> position;</div>
<div class="line"><a name="l03410"></a><span class="lineno"> 3410</span>&#160;      <span class="keywordtype">int</span> i,j,k,eIndex,hits=0;</div>
<div class="line"><a name="l03411"></a><span class="lineno"> 3411</span>&#160;      RootInfo ri;</div>
<div class="line"><a name="l03412"></a><span class="lineno"> 3412</span>&#160;      <span class="keywordtype">int</span> count=0;</div>
<div class="line"><a name="l03413"></a><span class="lineno"> 3413</span>&#160;      TreeOctNode* node;</div>
<div class="line"><a name="l03414"></a><span class="lineno"> 3414</span>&#160; </div>
<div class="line"><a name="l03415"></a><span class="lineno"> 3415</span>&#160;      node = tree.nextLeaf();</div>
<div class="line"><a name="l03416"></a><span class="lineno"> 3416</span>&#160;      <span class="keywordflow">while</span>( node )</div>
<div class="line"><a name="l03417"></a><span class="lineno"> 3417</span>&#160;      {</div>
<div class="line"><a name="l03418"></a><span class="lineno"> 3418</span>&#160;        <span class="keywordflow">if</span>( MarchingCubes::HasRoots( node-&gt;nodeData.mcIndex ) )</div>
<div class="line"><a name="l03419"></a><span class="lineno"> 3419</span>&#160;        {</div>
<div class="line"><a name="l03420"></a><span class="lineno"> 3420</span>&#160;          hits=0;</div>
<div class="line"><a name="l03421"></a><span class="lineno"> 3421</span>&#160;          <span class="keywordflow">for</span>( i=0 ; i&lt;DIMENSION ; i++ )</div>
<div class="line"><a name="l03422"></a><span class="lineno"> 3422</span>&#160;            <span class="keywordflow">for</span>( j=0 ; j&lt;2 ; j++ )</div>
<div class="line"><a name="l03423"></a><span class="lineno"> 3423</span>&#160;              <span class="keywordflow">for</span>( k=0 ; k&lt;2 ; k++ )</div>
<div class="line"><a name="l03424"></a><span class="lineno"> 3424</span>&#160;                <span class="keywordflow">if</span>( IsBoundaryEdge( node , i , j , k , sDepth ) )</div>
<div class="line"><a name="l03425"></a><span class="lineno"> 3425</span>&#160;                {</div>
<div class="line"><a name="l03426"></a><span class="lineno"> 3426</span>&#160;                  hits++;</div>
<div class="line"><a name="l03427"></a><span class="lineno"> 3427</span>&#160;                  <span class="keywordtype">long</span> <span class="keywordtype">long</span> key;</div>
<div class="line"><a name="l03428"></a><span class="lineno"> 3428</span>&#160;                  eIndex = Cube::EdgeIndex( i , j , k );</div>
<div class="line"><a name="l03429"></a><span class="lineno"> 3429</span>&#160;                  <span class="keywordflow">if</span>( GetRootIndex( node , eIndex , fData.depth , ri ) )</div>
<div class="line"><a name="l03430"></a><span class="lineno"> 3430</span>&#160;                  {</div>
<div class="line"><a name="l03431"></a><span class="lineno"> 3431</span>&#160;                    key = ri.key;</div>
<div class="line"><a name="l03432"></a><span class="lineno"> 3432</span>&#160;                    <span class="keywordflow">if</span>( rootData.boundaryRoots.find(key)==rootData.boundaryRoots.end() )</div>
<div class="line"><a name="l03433"></a><span class="lineno"> 3433</span>&#160;                    {</div>
<div class="line"><a name="l03434"></a><span class="lineno"> 3434</span>&#160;                      GetRoot( ri , isoValue , position , rootData , sDepth , nonLinearFit );</div>
<div class="line"><a name="l03435"></a><span class="lineno"> 3435</span>&#160;                      mesh-&gt;inCorePoints.push_back( position );</div>
<div class="line"><a name="l03436"></a><span class="lineno"> 3436</span>&#160;                      rootData.boundaryRoots[key] = int( mesh-&gt;inCorePoints.size() )-1;</div>
<div class="line"><a name="l03437"></a><span class="lineno"> 3437</span>&#160;                      count++;</div>
<div class="line"><a name="l03438"></a><span class="lineno"> 3438</span>&#160;                    }</div>
<div class="line"><a name="l03439"></a><span class="lineno"> 3439</span>&#160;                  }</div>
<div class="line"><a name="l03440"></a><span class="lineno"> 3440</span>&#160;                }</div>
<div class="line"><a name="l03441"></a><span class="lineno"> 3441</span>&#160;        }</div>
<div class="line"><a name="l03442"></a><span class="lineno"> 3442</span>&#160;        <span class="keywordflow">if</span>( hits ) node=tree.nextLeaf(node);</div>
<div class="line"><a name="l03443"></a><span class="lineno"> 3443</span>&#160;        <span class="keywordflow">else</span> node=tree.nextBranch(node);</div>
<div class="line"><a name="l03444"></a><span class="lineno"> 3444</span>&#160;      }</div>
<div class="line"><a name="l03445"></a><span class="lineno"> 3445</span>&#160;      <span class="keywordflow">return</span> count;</div>
<div class="line"><a name="l03446"></a><span class="lineno"> 3446</span>&#160;    }</div>
<div class="line"><a name="l03447"></a><span class="lineno"> 3447</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l03448"></a><span class="lineno"> 3448</span>&#160;    <span class="keywordtype">void</span> Octree&lt; Degree &gt;::GetMCIsoEdges( TreeOctNode* node , <span class="keywordtype">int</span> sDepth , std::vector&lt; std::pair&lt; RootInfo , RootInfo &gt; &gt;&amp; edges )</div>
<div class="line"><a name="l03449"></a><span class="lineno"> 3449</span>&#160;    {</div>
<div class="line"><a name="l03450"></a><span class="lineno"> 3450</span>&#160;      TreeOctNode* temp;</div>
<div class="line"><a name="l03451"></a><span class="lineno"> 3451</span>&#160;      <span class="keywordtype">int</span> count=0 , tris=0;</div>
<div class="line"><a name="l03452"></a><span class="lineno"> 3452</span>&#160;      <span class="keywordtype">int</span> isoTri[ DIMENSION * MarchingCubes::MAX_TRIANGLES ];</div>
<div class="line"><a name="l03453"></a><span class="lineno"> 3453</span>&#160;      FaceEdgesFunction fef;</div>
<div class="line"><a name="l03454"></a><span class="lineno"> 3454</span>&#160;      <span class="keywordtype">int</span> ref , fIndex;</div>
<div class="line"><a name="l03455"></a><span class="lineno"> 3455</span>&#160;      hash_map&lt; long long , std::pair&lt; RootInfo , int &gt; &gt;::iterator iter;</div>
<div class="line"><a name="l03456"></a><span class="lineno"> 3456</span>&#160;      hash_map&lt; long long , std::pair&lt; RootInfo , int &gt; &gt; vertexCount;</div>
<div class="line"><a name="l03457"></a><span class="lineno"> 3457</span>&#160; </div>
<div class="line"><a name="l03458"></a><span class="lineno"> 3458</span>&#160;      fef.edges = &amp;edges;</div>
<div class="line"><a name="l03459"></a><span class="lineno"> 3459</span>&#160;      fef.maxDepth = fData.depth;</div>
<div class="line"><a name="l03460"></a><span class="lineno"> 3460</span>&#160;      fef.vertexCount = &amp;vertexCount;</div>
<div class="line"><a name="l03461"></a><span class="lineno"> 3461</span>&#160;      count = MarchingCubes::AddTriangleIndices( node-&gt;nodeData.mcIndex , isoTri );</div>
<div class="line"><a name="l03462"></a><span class="lineno"> 3462</span>&#160;      <span class="keywordflow">for</span>( fIndex=0 ; fIndex&lt;Cube::NEIGHBORS ; fIndex++ )</div>
<div class="line"><a name="l03463"></a><span class="lineno"> 3463</span>&#160;      {</div>
<div class="line"><a name="l03464"></a><span class="lineno"> 3464</span>&#160;        ref = Cube::FaceReflectFaceIndex( fIndex , fIndex );</div>
<div class="line"><a name="l03465"></a><span class="lineno"> 3465</span>&#160;        fef.fIndex = ref;</div>
<div class="line"><a name="l03466"></a><span class="lineno"> 3466</span>&#160;        temp = node-&gt;faceNeighbor( fIndex );</div>
<div class="line"><a name="l03467"></a><span class="lineno"> 3467</span>&#160;        <span class="comment">// If the face neighbor exists and has higher resolution than the current node,</span></div>
<div class="line"><a name="l03468"></a><span class="lineno"> 3468</span>&#160;        <span class="comment">// get the iso-curve from the neighbor</span></div>
<div class="line"><a name="l03469"></a><span class="lineno"> 3469</span>&#160;        <span class="keywordflow">if</span>( temp &amp;&amp; temp-&gt;children &amp;&amp; !IsBoundaryFace( node , fIndex , sDepth ) ) temp-&gt;processNodeFaces( temp , &amp;fef , ref );</div>
<div class="line"><a name="l03470"></a><span class="lineno"> 3470</span>&#160;        <span class="comment">// Otherwise, get it from the node</span></div>
<div class="line"><a name="l03471"></a><span class="lineno"> 3471</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l03472"></a><span class="lineno"> 3472</span>&#160;        {</div>
<div class="line"><a name="l03473"></a><span class="lineno"> 3473</span>&#160;          RootInfo ri1 , ri2;</div>
<div class="line"><a name="l03474"></a><span class="lineno"> 3474</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=0 ; j&lt;count ; j++ )</div>
<div class="line"><a name="l03475"></a><span class="lineno"> 3475</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> k=0 ; k&lt;3 ; k++ )</div>
<div class="line"><a name="l03476"></a><span class="lineno"> 3476</span>&#160;              <span class="keywordflow">if</span>( fIndex==Cube::FaceAdjacentToEdges( isoTri[j*3+k] , isoTri[j*3+((k+1)%3)] ) )</div>
<div class="line"><a name="l03477"></a><span class="lineno"> 3477</span>&#160;                <span class="keywordflow">if</span>( GetRootIndex( node , isoTri[j*3+k] , fData.depth , ri1 ) &amp;&amp; GetRootIndex( node , isoTri[j*3+((k+1)%3)] , fData.depth , ri2 ) )</div>
<div class="line"><a name="l03478"></a><span class="lineno"> 3478</span>&#160;                {</div>
<div class="line"><a name="l03479"></a><span class="lineno"> 3479</span>&#160;                  <span class="keywordtype">long</span> <span class="keywordtype">long</span> key1 = ri1.key , key2 = ri2.key;</div>
<div class="line"><a name="l03480"></a><span class="lineno"> 3480</span>&#160;                  edges.push_back( std::pair&lt; RootInfo , RootInfo &gt;( ri1 , ri2 ) );</div>
<div class="line"><a name="l03481"></a><span class="lineno"> 3481</span>&#160;                  iter=vertexCount.find( key1 );</div>
<div class="line"><a name="l03482"></a><span class="lineno"> 3482</span>&#160;                  <span class="keywordflow">if</span>( iter==vertexCount.end() )</div>
<div class="line"><a name="l03483"></a><span class="lineno"> 3483</span>&#160;                  {</div>
<div class="line"><a name="l03484"></a><span class="lineno"> 3484</span>&#160;                    vertexCount[key1].first = ri1;</div>
<div class="line"><a name="l03485"></a><span class="lineno"> 3485</span>&#160;                    vertexCount[key1].second = 0;</div>
<div class="line"><a name="l03486"></a><span class="lineno"> 3486</span>&#160;                  }</div>
<div class="line"><a name="l03487"></a><span class="lineno"> 3487</span>&#160;                  iter=vertexCount.find( key2 );</div>
<div class="line"><a name="l03488"></a><span class="lineno"> 3488</span>&#160;                  <span class="keywordflow">if</span>( iter==vertexCount.end() )</div>
<div class="line"><a name="l03489"></a><span class="lineno"> 3489</span>&#160;                  {</div>
<div class="line"><a name="l03490"></a><span class="lineno"> 3490</span>&#160;                    vertexCount[key2].first = ri2;</div>
<div class="line"><a name="l03491"></a><span class="lineno"> 3491</span>&#160;                    vertexCount[key2].second = 0;</div>
<div class="line"><a name="l03492"></a><span class="lineno"> 3492</span>&#160;                  }</div>
<div class="line"><a name="l03493"></a><span class="lineno"> 3493</span>&#160;                  vertexCount[key1].second++;</div>
<div class="line"><a name="l03494"></a><span class="lineno"> 3494</span>&#160;                  vertexCount[key2].second--;</div>
<div class="line"><a name="l03495"></a><span class="lineno"> 3495</span>&#160;                }</div>
<div class="line"><a name="l03496"></a><span class="lineno"> 3496</span>&#160;                <span class="keywordflow">else</span></div>
<div class="line"><a name="l03497"></a><span class="lineno"> 3497</span>&#160;                {</div>
<div class="line"><a name="l03498"></a><span class="lineno"> 3498</span>&#160;                  <span class="keywordtype">int</span> r1 = MarchingCubes::HasEdgeRoots( node-&gt;nodeData.mcIndex , isoTri[j*3+k] );</div>
<div class="line"><a name="l03499"></a><span class="lineno"> 3499</span>&#160;                  <span class="keywordtype">int</span> r2 = MarchingCubes::HasEdgeRoots( node-&gt;nodeData.mcIndex , isoTri[j*3+((k+1)%3)] );</div>
<div class="line"><a name="l03500"></a><span class="lineno"> 3500</span>&#160;                  fprintf( stderr , <span class="stringliteral">&quot;Bad Edge 2: %d %d\t%d %d\n&quot;</span> , ri1.key , ri2.key , r1 , r2 );</div>
<div class="line"><a name="l03501"></a><span class="lineno"> 3501</span>&#160;                }</div>
<div class="line"><a name="l03502"></a><span class="lineno"> 3502</span>&#160;        }</div>
<div class="line"><a name="l03503"></a><span class="lineno"> 3503</span>&#160;      }</div>
<div class="line"><a name="l03504"></a><span class="lineno"> 3504</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;int(edges.size()) ; i++ )</div>
<div class="line"><a name="l03505"></a><span class="lineno"> 3505</span>&#160;      {</div>
<div class="line"><a name="l03506"></a><span class="lineno"> 3506</span>&#160;        iter = vertexCount.find( edges[i].first.key );</div>
<div class="line"><a name="l03507"></a><span class="lineno"> 3507</span>&#160;        <span class="keywordflow">if</span>( iter==vertexCount.end() ) printf( <span class="stringliteral">&quot;Could not find vertex: %lld\n&quot;</span> , edges[i].first );</div>
<div class="line"><a name="l03508"></a><span class="lineno"> 3508</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span>( vertexCount[ edges[i].first.key ].second )</div>
<div class="line"><a name="l03509"></a><span class="lineno"> 3509</span>&#160;        {</div>
<div class="line"><a name="l03510"></a><span class="lineno"> 3510</span>&#160;          RootInfo ri;</div>
<div class="line"><a name="l03511"></a><span class="lineno"> 3511</span>&#160;          GetRootPair( vertexCount[edges[i].first.key].first , fData.depth , ri );</div>
<div class="line"><a name="l03512"></a><span class="lineno"> 3512</span>&#160;          <span class="keywordtype">long</span> <span class="keywordtype">long</span> key = ri.key;</div>
<div class="line"><a name="l03513"></a><span class="lineno"> 3513</span>&#160;          iter = vertexCount.find( key );</div>
<div class="line"><a name="l03514"></a><span class="lineno"> 3514</span>&#160;          <span class="keywordflow">if</span>( iter==vertexCount.end() )</div>
<div class="line"><a name="l03515"></a><span class="lineno"> 3515</span>&#160;          {</div>
<div class="line"><a name="l03516"></a><span class="lineno"> 3516</span>&#160;            <span class="keywordtype">int</span> d , off[3];</div>
<div class="line"><a name="l03517"></a><span class="lineno"> 3517</span>&#160;            node-&gt;depthAndOffset( d , off );</div>
<div class="line"><a name="l03518"></a><span class="lineno"> 3518</span>&#160;            printf( <span class="stringliteral">&quot;Vertex pair not in list 1 (%lld) %d\t[%d] (%d %d %d)\n&quot;</span> , key , IsBoundaryEdge( ri.node , ri.edgeIndex , sDepth ) , d , off[0] , off[1] , off[2] );</div>
<div class="line"><a name="l03519"></a><span class="lineno"> 3519</span>&#160;          }</div>
<div class="line"><a name="l03520"></a><span class="lineno"> 3520</span>&#160;          <span class="keywordflow">else</span></div>
<div class="line"><a name="l03521"></a><span class="lineno"> 3521</span>&#160;          {</div>
<div class="line"><a name="l03522"></a><span class="lineno"> 3522</span>&#160;            edges.push_back( std::pair&lt; RootInfo , RootInfo &gt;( ri , edges[i].first ) );</div>
<div class="line"><a name="l03523"></a><span class="lineno"> 3523</span>&#160;            vertexCount[ key ].second++;</div>
<div class="line"><a name="l03524"></a><span class="lineno"> 3524</span>&#160;            vertexCount[ edges[i].first.key ].second--;</div>
<div class="line"><a name="l03525"></a><span class="lineno"> 3525</span>&#160;          }</div>
<div class="line"><a name="l03526"></a><span class="lineno"> 3526</span>&#160;        }</div>
<div class="line"><a name="l03527"></a><span class="lineno"> 3527</span>&#160; </div>
<div class="line"><a name="l03528"></a><span class="lineno"> 3528</span>&#160;        iter = vertexCount.find( edges[i].second.key );</div>
<div class="line"><a name="l03529"></a><span class="lineno"> 3529</span>&#160;        <span class="keywordflow">if</span>( iter==vertexCount.end() ) printf( <span class="stringliteral">&quot;Could not find vertex: %lld\n&quot;</span> , edges[i].second );</div>
<div class="line"><a name="l03530"></a><span class="lineno"> 3530</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span>( vertexCount[edges[i].second.key].second )</div>
<div class="line"><a name="l03531"></a><span class="lineno"> 3531</span>&#160;        {</div>
<div class="line"><a name="l03532"></a><span class="lineno"> 3532</span>&#160;          RootInfo ri;</div>
<div class="line"><a name="l03533"></a><span class="lineno"> 3533</span>&#160;          GetRootPair( vertexCount[edges[i].second.key].first , fData.depth , ri );</div>
<div class="line"><a name="l03534"></a><span class="lineno"> 3534</span>&#160;          <span class="keywordtype">long</span> <span class="keywordtype">long</span> key = ri.key;</div>
<div class="line"><a name="l03535"></a><span class="lineno"> 3535</span>&#160;          iter=vertexCount.find( key );</div>
<div class="line"><a name="l03536"></a><span class="lineno"> 3536</span>&#160;          <span class="keywordflow">if</span>( iter==vertexCount.end() )</div>
<div class="line"><a name="l03537"></a><span class="lineno"> 3537</span>&#160;          {</div>
<div class="line"><a name="l03538"></a><span class="lineno"> 3538</span>&#160;            <span class="keywordtype">int</span> d , off[3];</div>
<div class="line"><a name="l03539"></a><span class="lineno"> 3539</span>&#160;            node-&gt;depthAndOffset( d , off );</div>
<div class="line"><a name="l03540"></a><span class="lineno"> 3540</span>&#160;            printf( <span class="stringliteral">&quot;Vertex pair not in list 2\t[%d] (%d %d %d)\n&quot;</span> , d , off[0] , off[1] , off[2] );</div>
<div class="line"><a name="l03541"></a><span class="lineno"> 3541</span>&#160;          }</div>
<div class="line"><a name="l03542"></a><span class="lineno"> 3542</span>&#160;          <span class="keywordflow">else</span></div>
<div class="line"><a name="l03543"></a><span class="lineno"> 3543</span>&#160;          {</div>
<div class="line"><a name="l03544"></a><span class="lineno"> 3544</span>&#160;            edges.push_back( std::pair&lt; RootInfo , RootInfo &gt;( edges[i].second , ri ) );</div>
<div class="line"><a name="l03545"></a><span class="lineno"> 3545</span>&#160;            vertexCount[key].second--;</div>
<div class="line"><a name="l03546"></a><span class="lineno"> 3546</span>&#160;            vertexCount[ edges[i].second.key ].second++;</div>
<div class="line"><a name="l03547"></a><span class="lineno"> 3547</span>&#160;          }</div>
<div class="line"><a name="l03548"></a><span class="lineno"> 3548</span>&#160;        }</div>
<div class="line"><a name="l03549"></a><span class="lineno"> 3549</span>&#160;      }</div>
<div class="line"><a name="l03550"></a><span class="lineno"> 3550</span>&#160;    }</div>
<div class="line"><a name="l03551"></a><span class="lineno"> 3551</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l03552"></a><span class="lineno"> 3552</span>&#160;<span class="preprocessor">#if MISHA_DEBUG</span></div>
<div class="line"><a name="l03553"></a><span class="lineno"> 3553</span>&#160;    <span class="keywordtype">int</span> Octree&lt; Degree &gt;::GetMCIsoTriangles( TreeOctNode* node , CoredMeshData* mesh , RootData&amp; rootData , std::vector&lt; <a class="code" href="structpcl_1_1poisson_1_1_point3_d.html">Point3D&lt; float &gt;</a> &gt;* interiorPositions , <span class="keywordtype">int</span> offSet , <span class="keywordtype">int</span> sDepth , <span class="keywordtype">bool</span> polygonMesh , std::vector&lt; <a class="code" href="structpcl_1_1poisson_1_1_point3_d.html">Point3D&lt; float &gt;</a> &gt;* barycenters )</div>
<div class="line"><a name="l03554"></a><span class="lineno"> 3554</span>&#160;<span class="preprocessor">#else </span><span class="comment">// !MISHA_DEBUG</span></div>
<div class="line"><a name="l03555"></a><span class="lineno"> 3555</span>&#160;    <span class="keywordtype">int</span> Octree&lt; Degree &gt;::GetMCIsoTriangles( TreeOctNode* node , CoredMeshData* mesh , RootData&amp; rootData , std::vector&lt; <a class="code" href="structpcl_1_1poisson_1_1_point3_d.html">Point3D&lt; float &gt;</a> &gt;* interiorPositions , <span class="keywordtype">int</span> offSet , <span class="keywordtype">int</span> sDepth , <span class="keywordtype">bool</span> addBarycenter , <span class="keywordtype">bool</span> polygonMesh )</div>
<div class="line"><a name="l03556"></a><span class="lineno"> 3556</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// MISHA_DEBUG</span></div>
<div class="line"><a name="l03557"></a><span class="lineno"> 3557</span>&#160;    {</div>
<div class="line"><a name="l03558"></a><span class="lineno"> 3558</span>&#160;      <span class="keywordtype">int</span> tris=0;</div>
<div class="line"><a name="l03559"></a><span class="lineno"> 3559</span>&#160;      std::vector&lt; std::pair&lt; RootInfo , RootInfo &gt; &gt; edges;</div>
<div class="line"><a name="l03560"></a><span class="lineno"> 3560</span>&#160;      std::vector&lt; std::vector&lt; std::pair&lt; RootInfo , RootInfo &gt; &gt; &gt; edgeLoops;</div>
<div class="line"><a name="l03561"></a><span class="lineno"> 3561</span>&#160;      GetMCIsoEdges( node , sDepth , edges );</div>
<div class="line"><a name="l03562"></a><span class="lineno"> 3562</span>&#160; </div>
<div class="line"><a name="l03563"></a><span class="lineno"> 3563</span>&#160;      GetEdgeLoops( edges , edgeLoops );</div>
<div class="line"><a name="l03564"></a><span class="lineno"> 3564</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;int(edgeLoops.size()) ; i++ )</div>
<div class="line"><a name="l03565"></a><span class="lineno"> 3565</span>&#160;      {</div>
<div class="line"><a name="l03566"></a><span class="lineno"> 3566</span>&#160;        CoredPointIndex p;</div>
<div class="line"><a name="l03567"></a><span class="lineno"> 3567</span>&#160;        std::vector&lt;CoredPointIndex&gt; edgeIndices;</div>
<div class="line"><a name="l03568"></a><span class="lineno"> 3568</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=0 ; j&lt;int(edgeLoops[i].size()) ; j++ )</div>
<div class="line"><a name="l03569"></a><span class="lineno"> 3569</span>&#160;        {</div>
<div class="line"><a name="l03570"></a><span class="lineno"> 3570</span>&#160;          <span class="keywordflow">if</span>( !GetRootIndex( edgeLoops[i][j].first , rootData , p ) ) printf( <span class="stringliteral">&quot;Bad Point Index\n&quot;</span> );</div>
<div class="line"><a name="l03571"></a><span class="lineno"> 3571</span>&#160;          <span class="keywordflow">else</span> edgeIndices.push_back( p );</div>
<div class="line"><a name="l03572"></a><span class="lineno"> 3572</span>&#160;        }</div>
<div class="line"><a name="l03573"></a><span class="lineno"> 3573</span>&#160;<span class="preprocessor">#if MISHA_DEBUG</span></div>
<div class="line"><a name="l03574"></a><span class="lineno"> 3574</span>&#160;        tris += AddTriangles( mesh , edgeIndices , interiorPositions , offSet , polygonMesh , barycenters );</div>
<div class="line"><a name="l03575"></a><span class="lineno"> 3575</span>&#160;<span class="preprocessor">#else </span><span class="comment">// !MISHA_DEBUG</span></div>
<div class="line"><a name="l03576"></a><span class="lineno"> 3576</span>&#160;        tris += AddTriangles( mesh , edgeIndices , interiorPositions , offSet , addBarycenter , polygonMesh );</div>
<div class="line"><a name="l03577"></a><span class="lineno"> 3577</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// MISHA_DEBUG</span></div>
<div class="line"><a name="l03578"></a><span class="lineno"> 3578</span>&#160;      }</div>
<div class="line"><a name="l03579"></a><span class="lineno"> 3579</span>&#160;      <span class="keywordflow">return</span> tris;</div>
<div class="line"><a name="l03580"></a><span class="lineno"> 3580</span>&#160;    }</div>
<div class="line"><a name="l03581"></a><span class="lineno"> 3581</span>&#160; </div>
<div class="line"><a name="l03582"></a><span class="lineno"> 3582</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l03583"></a><span class="lineno"> 3583</span>&#160;    <span class="keywordtype">int</span> Octree&lt; Degree &gt;::GetEdgeLoops( std::vector&lt; std::pair&lt; RootInfo , RootInfo &gt; &gt;&amp; edges , std::vector&lt; std::vector&lt; std::pair&lt; RootInfo , RootInfo &gt; &gt; &gt;&amp; loops )</div>
<div class="line"><a name="l03584"></a><span class="lineno"> 3584</span>&#160;    {</div>
<div class="line"><a name="l03585"></a><span class="lineno"> 3585</span>&#160;      <span class="keywordtype">int</span> loopSize=0;</div>
<div class="line"><a name="l03586"></a><span class="lineno"> 3586</span>&#160;      <span class="keywordtype">long</span> <span class="keywordtype">long</span> frontIdx , backIdx;</div>
<div class="line"><a name="l03587"></a><span class="lineno"> 3587</span>&#160;      std::pair&lt; RootInfo , RootInfo &gt; e , temp;</div>
<div class="line"><a name="l03588"></a><span class="lineno"> 3588</span>&#160;      loops.clear();</div>
<div class="line"><a name="l03589"></a><span class="lineno"> 3589</span>&#160; </div>
<div class="line"><a name="l03590"></a><span class="lineno"> 3590</span>&#160;      <span class="keywordflow">while</span>( edges.size() )</div>
<div class="line"><a name="l03591"></a><span class="lineno"> 3591</span>&#160;      {</div>
<div class="line"><a name="l03592"></a><span class="lineno"> 3592</span>&#160;        std::vector&lt; std::pair&lt; RootInfo ,  RootInfo &gt; &gt; front , back;</div>
<div class="line"><a name="l03593"></a><span class="lineno"> 3593</span>&#160;        e = edges[0];</div>
<div class="line"><a name="l03594"></a><span class="lineno"> 3594</span>&#160;        loops.resize( loopSize+1 );</div>
<div class="line"><a name="l03595"></a><span class="lineno"> 3595</span>&#160;        edges[0] = edges.back();</div>
<div class="line"><a name="l03596"></a><span class="lineno"> 3596</span>&#160;        edges.pop_back();</div>
<div class="line"><a name="l03597"></a><span class="lineno"> 3597</span>&#160;        frontIdx = e.second.key;</div>
<div class="line"><a name="l03598"></a><span class="lineno"> 3598</span>&#160;        backIdx = e.first.key;</div>
<div class="line"><a name="l03599"></a><span class="lineno"> 3599</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=<span class="keywordtype">int</span>(edges.size())-1 ; j&gt;=0 ; j-- )</div>
<div class="line"><a name="l03600"></a><span class="lineno"> 3600</span>&#160;        {</div>
<div class="line"><a name="l03601"></a><span class="lineno"> 3601</span>&#160;          <span class="keywordflow">if</span>( edges[j].first.key==frontIdx || edges[j].second.key==frontIdx )</div>
<div class="line"><a name="l03602"></a><span class="lineno"> 3602</span>&#160;          {</div>
<div class="line"><a name="l03603"></a><span class="lineno"> 3603</span>&#160;            <span class="keywordflow">if</span>( edges[j].first.key==frontIdx ) temp = edges[j];</div>
<div class="line"><a name="l03604"></a><span class="lineno"> 3604</span>&#160;            <span class="keywordflow">else</span> temp.first = edges[j].second , temp.second = edges[j].first;</div>
<div class="line"><a name="l03605"></a><span class="lineno"> 3605</span>&#160;            frontIdx = temp.second.key;</div>
<div class="line"><a name="l03606"></a><span class="lineno"> 3606</span>&#160;            front.push_back(temp);</div>
<div class="line"><a name="l03607"></a><span class="lineno"> 3607</span>&#160;            edges[j] = edges.back();</div>
<div class="line"><a name="l03608"></a><span class="lineno"> 3608</span>&#160;            edges.pop_back();</div>
<div class="line"><a name="l03609"></a><span class="lineno"> 3609</span>&#160;            j = int(edges.size());</div>
<div class="line"><a name="l03610"></a><span class="lineno"> 3610</span>&#160;          }</div>
<div class="line"><a name="l03611"></a><span class="lineno"> 3611</span>&#160;          <span class="keywordflow">else</span> <span class="keywordflow">if</span>( edges[j].first.key==backIdx || edges[j].second.key==backIdx )</div>
<div class="line"><a name="l03612"></a><span class="lineno"> 3612</span>&#160;          {</div>
<div class="line"><a name="l03613"></a><span class="lineno"> 3613</span>&#160;            <span class="keywordflow">if</span>( edges[j].second.key==backIdx ) temp = edges[j];</div>
<div class="line"><a name="l03614"></a><span class="lineno"> 3614</span>&#160;            <span class="keywordflow">else</span> temp.first = edges[j].second , temp.second = edges[j].first;</div>
<div class="line"><a name="l03615"></a><span class="lineno"> 3615</span>&#160;            backIdx = temp.first.key;</div>
<div class="line"><a name="l03616"></a><span class="lineno"> 3616</span>&#160;            back.push_back(temp);</div>
<div class="line"><a name="l03617"></a><span class="lineno"> 3617</span>&#160;            edges[j] = edges.back();</div>
<div class="line"><a name="l03618"></a><span class="lineno"> 3618</span>&#160;            edges.pop_back();</div>
<div class="line"><a name="l03619"></a><span class="lineno"> 3619</span>&#160;            j = int(edges.size());</div>
<div class="line"><a name="l03620"></a><span class="lineno"> 3620</span>&#160;          }</div>
<div class="line"><a name="l03621"></a><span class="lineno"> 3621</span>&#160;        }</div>
<div class="line"><a name="l03622"></a><span class="lineno"> 3622</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=<span class="keywordtype">int</span>(back.size())-1 ; j&gt;=0 ; j-- ) loops[loopSize].push_back( back[j] );</div>
<div class="line"><a name="l03623"></a><span class="lineno"> 3623</span>&#160;        loops[loopSize].push_back(e);</div>
<div class="line"><a name="l03624"></a><span class="lineno"> 3624</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=0 ; j&lt;int(front.size()) ; j++ ) loops[loopSize].push_back( front[j] );</div>
<div class="line"><a name="l03625"></a><span class="lineno"> 3625</span>&#160;        loopSize++;</div>
<div class="line"><a name="l03626"></a><span class="lineno"> 3626</span>&#160;      }</div>
<div class="line"><a name="l03627"></a><span class="lineno"> 3627</span>&#160;      <span class="keywordflow">return</span> int(loops.size());</div>
<div class="line"><a name="l03628"></a><span class="lineno"> 3628</span>&#160;    }</div>
<div class="line"><a name="l03629"></a><span class="lineno"> 3629</span>&#160;    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> Degree&gt;</div>
<div class="line"><a name="l03630"></a><span class="lineno"> 3630</span>&#160;<span class="preprocessor">#if MISHA_DEBUG</span></div>
<div class="line"><a name="l03631"></a><span class="lineno"> 3631</span>&#160;    <span class="keywordtype">int</span> Octree&lt;Degree&gt;::AddTriangles( CoredMeshData* mesh , std::vector&lt;CoredPointIndex&gt;&amp; edges , std::vector&lt;<a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;float&gt;</a> &gt;* interiorPositions , <span class="keywordtype">int</span> offSet , <span class="keywordtype">bool</span> polygonMesh , std::vector&lt; <a class="code" href="structpcl_1_1poisson_1_1_point3_d.html">Point3D&lt; float &gt;</a> &gt;* barycenters )</div>
<div class="line"><a name="l03632"></a><span class="lineno"> 3632</span>&#160;<span class="preprocessor">#else </span><span class="comment">// !MISHA_DEBUG</span></div>
<div class="line"><a name="l03633"></a><span class="lineno"> 3633</span>&#160;    <span class="keywordtype">int</span> Octree&lt;Degree&gt;::AddTriangles( CoredMeshData* mesh , std::vector&lt;CoredPointIndex&gt;&amp; edges , std::vector&lt;<a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;float&gt;</a> &gt;* interiorPositions , <span class="keywordtype">int</span> offSet , <span class="keywordtype">bool</span> addBarycenter , <span class="keywordtype">bool</span> polygonMesh )</div>
<div class="line"><a name="l03634"></a><span class="lineno"> 3634</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// MISHA_DEBUG</span></div>
<div class="line"><a name="l03635"></a><span class="lineno"> 3635</span>&#160;    {</div>
<div class="line"><a name="l03636"></a><span class="lineno"> 3636</span>&#160;      MinimalAreaTriangulation&lt; float &gt; MAT;</div>
<div class="line"><a name="l03637"></a><span class="lineno"> 3637</span>&#160;      std::vector&lt; Point3D&lt; float &gt; &gt; vertices;</div>
<div class="line"><a name="l03638"></a><span class="lineno"> 3638</span>&#160;      std::vector&lt; TriangleIndex &gt; triangles;</div>
<div class="line"><a name="l03639"></a><span class="lineno"> 3639</span>&#160;      <span class="keywordflow">if</span>( polygonMesh )</div>
<div class="line"><a name="l03640"></a><span class="lineno"> 3640</span>&#160;      {</div>
<div class="line"><a name="l03641"></a><span class="lineno"> 3641</span>&#160;        std::vector&lt; CoredVertexIndex &gt; vertices( edges.size() );</div>
<div class="line"><a name="l03642"></a><span class="lineno"> 3642</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;int(edges.size()) ; i++ )</div>
<div class="line"><a name="l03643"></a><span class="lineno"> 3643</span>&#160;        {</div>
<div class="line"><a name="l03644"></a><span class="lineno"> 3644</span>&#160;          vertices[i].idx    =  edges[i].index;</div>
<div class="line"><a name="l03645"></a><span class="lineno"> 3645</span>&#160;          vertices[i].inCore = (edges[i].inCore!=0);</div>
<div class="line"><a name="l03646"></a><span class="lineno"> 3646</span>&#160;        }</div>
<div class="line"><a name="l03647"></a><span class="lineno"> 3647</span>&#160;<span class="preprocessor">#pragma omp critical (add_polygon_access)</span></div>
<div class="line"><a name="l03648"></a><span class="lineno"> 3648</span>&#160;        {</div>
<div class="line"><a name="l03649"></a><span class="lineno"> 3649</span>&#160;          mesh-&gt;addPolygon( vertices );</div>
<div class="line"><a name="l03650"></a><span class="lineno"> 3650</span>&#160;        }</div>
<div class="line"><a name="l03651"></a><span class="lineno"> 3651</span>&#160;        <span class="keywordflow">return</span> 1;</div>
<div class="line"><a name="l03652"></a><span class="lineno"> 3652</span>&#160;      }</div>
<div class="line"><a name="l03653"></a><span class="lineno"> 3653</span>&#160;      <span class="keywordflow">if</span>( edges.size()&gt;3 )</div>
<div class="line"><a name="l03654"></a><span class="lineno"> 3654</span>&#160;      {</div>
<div class="line"><a name="l03655"></a><span class="lineno"> 3655</span>&#160;        <span class="keywordtype">bool</span> isCoplanar = <span class="keyword">false</span>;</div>
<div class="line"><a name="l03656"></a><span class="lineno"> 3656</span>&#160; </div>
<div class="line"><a name="l03657"></a><span class="lineno"> 3657</span>&#160;<span class="preprocessor">#if MISHA_DEBUG</span></div>
<div class="line"><a name="l03658"></a><span class="lineno"> 3658</span>&#160;        <span class="keywordflow">if</span>( barycenters )</div>
<div class="line"><a name="l03659"></a><span class="lineno"> 3659</span>&#160;<span class="preprocessor">#else </span><span class="comment">// !MISHA_DEBUG</span></div>
<div class="line"><a name="l03660"></a><span class="lineno"> 3660</span>&#160;        <span class="keywordflow">if</span>( addBarycenter )</div>
<div class="line"><a name="l03661"></a><span class="lineno"> 3661</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// MISHA_DEBUG</span></div>
<div class="line"><a name="l03662"></a><span class="lineno"> 3662</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;int(edges.size()) ; i++ )</div>
<div class="line"><a name="l03663"></a><span class="lineno"> 3663</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=0 ; j&lt;i ; j++ )</div>
<div class="line"><a name="l03664"></a><span class="lineno"> 3664</span>&#160;              <span class="keywordflow">if</span>( (i+1)%edges.size()!=j &amp;&amp; (j+1)%edges.size()!=i )</div>
<div class="line"><a name="l03665"></a><span class="lineno"> 3665</span>&#160;              {</div>
<div class="line"><a name="l03666"></a><span class="lineno"> 3666</span>&#160;                <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> v1 , v2;</div>
<div class="line"><a name="l03667"></a><span class="lineno"> 3667</span>&#160;                <span class="keywordflow">if</span>( edges[i].inCore ) v1 =   mesh-&gt;inCorePoints[ edges[i].index        ];</div>
<div class="line"><a name="l03668"></a><span class="lineno"> 3668</span>&#160;                <span class="keywordflow">else</span>                  v1 = (*interiorPositions)[ edges[i].index-offSet ];</div>
<div class="line"><a name="l03669"></a><span class="lineno"> 3669</span>&#160;                <span class="keywordflow">if</span>( edges[j].inCore ) v2 =   mesh-&gt;inCorePoints[ edges[j].index        ];</div>
<div class="line"><a name="l03670"></a><span class="lineno"> 3670</span>&#160;                <span class="keywordflow">else</span>                  v2 = (*interiorPositions)[ edges[j].index-offSet ];</div>
<div class="line"><a name="l03671"></a><span class="lineno"> 3671</span>&#160;                <span class="keywordflow">for</span>( <span class="keywordtype">int</span> k=0 ; k&lt;3 ; k++ ) <span class="keywordflow">if</span>( v1[k]==v2[k] ) isCoplanar = <span class="keyword">true</span>;</div>
<div class="line"><a name="l03672"></a><span class="lineno"> 3672</span>&#160;              }</div>
<div class="line"><a name="l03673"></a><span class="lineno"> 3673</span>&#160;        <span class="keywordflow">if</span>( isCoplanar )</div>
<div class="line"><a name="l03674"></a><span class="lineno"> 3674</span>&#160;        {</div>
<div class="line"><a name="l03675"></a><span class="lineno"> 3675</span>&#160;          <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> c;</div>
<div class="line"><a name="l03676"></a><span class="lineno"> 3676</span>&#160;          c[0] = c[1] = c[2] = 0;</div>
<div class="line"><a name="l03677"></a><span class="lineno"> 3677</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;int(edges.size()) ; i++ )</div>
<div class="line"><a name="l03678"></a><span class="lineno"> 3678</span>&#160;          {</div>
<div class="line"><a name="l03679"></a><span class="lineno"> 3679</span>&#160;            <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt;Real&gt;</a> p;</div>
<div class="line"><a name="l03680"></a><span class="lineno"> 3680</span>&#160;            <span class="keywordflow">if</span>(edges[i].inCore) p =   mesh-&gt;inCorePoints[edges[i].index       ];</div>
<div class="line"><a name="l03681"></a><span class="lineno"> 3681</span>&#160;            <span class="keywordflow">else</span>                p = (*interiorPositions)[edges[i].index-offSet];</div>
<div class="line"><a name="l03682"></a><span class="lineno"> 3682</span>&#160;            c += p;</div>
<div class="line"><a name="l03683"></a><span class="lineno"> 3683</span>&#160;          }</div>
<div class="line"><a name="l03684"></a><span class="lineno"> 3684</span>&#160;          c /= Real( edges.size() );</div>
<div class="line"><a name="l03685"></a><span class="lineno"> 3685</span>&#160;          <span class="keywordtype">int</span> cIdx;</div>
<div class="line"><a name="l03686"></a><span class="lineno"> 3686</span>&#160;<span class="preprocessor">#pragma omp critical (add_point_access)</span></div>
<div class="line"><a name="l03687"></a><span class="lineno"> 3687</span>&#160;          {</div>
<div class="line"><a name="l03688"></a><span class="lineno"> 3688</span>&#160;            cIdx = mesh-&gt;addOutOfCorePoint( c );</div>
<div class="line"><a name="l03689"></a><span class="lineno"> 3689</span>&#160;<span class="preprocessor">#if MISHA_DEBUG</span></div>
<div class="line"><a name="l03690"></a><span class="lineno"> 3690</span>&#160;            barycenters-&gt;push_back( c );</div>
<div class="line"><a name="l03691"></a><span class="lineno"> 3691</span>&#160;<span class="preprocessor">#else </span><span class="comment">// !MISHA_DEBUG</span></div>
<div class="line"><a name="l03692"></a><span class="lineno"> 3692</span>&#160;            interiorPositions-&gt;push_back( c );</div>
<div class="line"><a name="l03693"></a><span class="lineno"> 3693</span>&#160;<span class="preprocessor">#endif </span><span class="comment">// MISHA_DEBUG</span></div>
<div class="line"><a name="l03694"></a><span class="lineno"> 3694</span>&#160;          }</div>
<div class="line"><a name="l03695"></a><span class="lineno"> 3695</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;int(edges.size()) ; i++ )</div>
<div class="line"><a name="l03696"></a><span class="lineno"> 3696</span>&#160;          {</div>
<div class="line"><a name="l03697"></a><span class="lineno"> 3697</span>&#160;            std::vector&lt; CoredVertexIndex &gt; vertices( 3 );</div>
<div class="line"><a name="l03698"></a><span class="lineno"> 3698</span>&#160;            vertices[0].idx = edges[i                 ].index;</div>
<div class="line"><a name="l03699"></a><span class="lineno"> 3699</span>&#160;            vertices[1].idx = edges[(i+1)%edges.size()].index;</div>
<div class="line"><a name="l03700"></a><span class="lineno"> 3700</span>&#160;            vertices[2].idx = cIdx;</div>
<div class="line"><a name="l03701"></a><span class="lineno"> 3701</span>&#160;            vertices[0].inCore = (edges[i                 ].inCore!=0);</div>
<div class="line"><a name="l03702"></a><span class="lineno"> 3702</span>&#160;            vertices[1].inCore = (edges[(i+1)%edges.size()].inCore!=0);</div>
<div class="line"><a name="l03703"></a><span class="lineno"> 3703</span>&#160;            vertices[2].inCore = 0;</div>
<div class="line"><a name="l03704"></a><span class="lineno"> 3704</span>&#160;<span class="preprocessor">#pragma omp critical (add_polygon_access)</span></div>
<div class="line"><a name="l03705"></a><span class="lineno"> 3705</span>&#160;            {</div>
<div class="line"><a name="l03706"></a><span class="lineno"> 3706</span>&#160;              mesh-&gt;addPolygon( vertices );</div>
<div class="line"><a name="l03707"></a><span class="lineno"> 3707</span>&#160;            }</div>
<div class="line"><a name="l03708"></a><span class="lineno"> 3708</span>&#160;          }</div>
<div class="line"><a name="l03709"></a><span class="lineno"> 3709</span>&#160;          <span class="keywordflow">return</span> int( edges.size() );</div>
<div class="line"><a name="l03710"></a><span class="lineno"> 3710</span>&#160;        }</div>
<div class="line"><a name="l03711"></a><span class="lineno"> 3711</span>&#160;        <span class="keywordflow">else</span></div>
<div class="line"><a name="l03712"></a><span class="lineno"> 3712</span>&#160;        {</div>
<div class="line"><a name="l03713"></a><span class="lineno"> 3713</span>&#160;          vertices.resize( edges.size() );</div>
<div class="line"><a name="l03714"></a><span class="lineno"> 3714</span>&#160;          <span class="comment">// Add the points</span></div>
<div class="line"><a name="l03715"></a><span class="lineno"> 3715</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;int(edges.size()) ; i++ )</div>
<div class="line"><a name="l03716"></a><span class="lineno"> 3716</span>&#160;          {</div>
<div class="line"><a name="l03717"></a><span class="lineno"> 3717</span>&#160;            <a class="code" href="structpcl_1_1_point_x_y_z_r_g_b_a.html">Point3D&lt; Real &gt;</a> p;</div>
<div class="line"><a name="l03718"></a><span class="lineno"> 3718</span>&#160;            <span class="keywordflow">if</span>( edges[i].inCore ) p =   mesh-&gt;inCorePoints[edges[i].index       ];</div>
<div class="line"><a name="l03719"></a><span class="lineno"> 3719</span>&#160;            <span class="keywordflow">else</span>                  p = (*interiorPositions)[edges[i].index-offSet];</div>
<div class="line"><a name="l03720"></a><span class="lineno"> 3720</span>&#160;            vertices[i] = p;</div>
<div class="line"><a name="l03721"></a><span class="lineno"> 3721</span>&#160;          }</div>
<div class="line"><a name="l03722"></a><span class="lineno"> 3722</span>&#160;          MAT.GetTriangulation( vertices , triangles );</div>
<div class="line"><a name="l03723"></a><span class="lineno"> 3723</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;int(triangles.size()) ; i++ )</div>
<div class="line"><a name="l03724"></a><span class="lineno"> 3724</span>&#160;          {</div>
<div class="line"><a name="l03725"></a><span class="lineno"> 3725</span>&#160;            std::vector&lt; CoredVertexIndex &gt; _vertices( 3 );</div>
<div class="line"><a name="l03726"></a><span class="lineno"> 3726</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> j=0 ; j&lt;3 ; j++ )</div>
<div class="line"><a name="l03727"></a><span class="lineno"> 3727</span>&#160;            {</div>
<div class="line"><a name="l03728"></a><span class="lineno"> 3728</span>&#160;              _vertices[j].idx    =  edges[ triangles[i].idx[j] ].index;</div>
<div class="line"><a name="l03729"></a><span class="lineno"> 3729</span>&#160;              _vertices[j].inCore = (edges[ triangles[i].idx[j] ].inCore!=0);</div>
<div class="line"><a name="l03730"></a><span class="lineno"> 3730</span>&#160;            }</div>
<div class="line"><a name="l03731"></a><span class="lineno"> 3731</span>&#160;<span class="preprocessor">#pragma omp critical (add_polygon_access)</span></div>
<div class="line"><a name="l03732"></a><span class="lineno"> 3732</span>&#160;            {</div>
<div class="line"><a name="l03733"></a><span class="lineno"> 3733</span>&#160;              mesh-&gt;addPolygon( _vertices );</div>
<div class="line"><a name="l03734"></a><span class="lineno"> 3734</span>&#160;            }</div>
<div class="line"><a name="l03735"></a><span class="lineno"> 3735</span>&#160;          }</div>
<div class="line"><a name="l03736"></a><span class="lineno"> 3736</span>&#160;        }</div>
<div class="line"><a name="l03737"></a><span class="lineno"> 3737</span>&#160;      }</div>
<div class="line"><a name="l03738"></a><span class="lineno"> 3738</span>&#160;      <span class="keywordflow">else</span> <span class="keywordflow">if</span>( edges.size()==3 )</div>
<div class="line"><a name="l03739"></a><span class="lineno"> 3739</span>&#160;      {</div>
<div class="line"><a name="l03740"></a><span class="lineno"> 3740</span>&#160;        std::vector&lt; CoredVertexIndex &gt; vertices( 3 );</div>
<div class="line"><a name="l03741"></a><span class="lineno"> 3741</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;3 ; i++ )</div>
<div class="line"><a name="l03742"></a><span class="lineno"> 3742</span>&#160;        {</div>
<div class="line"><a name="l03743"></a><span class="lineno"> 3743</span>&#160;          vertices[i].idx    =  edges[i].index;</div>
<div class="line"><a name="l03744"></a><span class="lineno"> 3744</span>&#160;          vertices[i].inCore = (edges[i].inCore!=0);</div>
<div class="line"><a name="l03745"></a><span class="lineno"> 3745</span>&#160;        }</div>
<div class="line"><a name="l03746"></a><span class="lineno"> 3746</span>&#160;<span class="preprocessor">#pragma omp critical (add_polygon_access)</span></div>
<div class="line"><a name="l03747"></a><span class="lineno"> 3747</span>&#160;        mesh-&gt;addPolygon( vertices );</div>
<div class="line"><a name="l03748"></a><span class="lineno"> 3748</span>&#160;      }</div>
<div class="line"><a name="l03749"></a><span class="lineno"> 3749</span>&#160;      <span class="keywordflow">return</span> int(edges.size())-2;</div>
<div class="line"><a name="l03750"></a><span class="lineno"> 3750</span>&#160;    }</div>
<div class="line"><a name="l03751"></a><span class="lineno"> 3751</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l03752"></a><span class="lineno"> 3752</span>&#160;    Real* Octree&lt; Degree &gt;::GetSolutionGrid( <span class="keywordtype">int</span>&amp; res , <span class="keywordtype">float</span> isoValue , <span class="keywordtype">int</span> depth )</div>
<div class="line"><a name="l03753"></a><span class="lineno"> 3753</span>&#160;    {</div>
<div class="line"><a name="l03754"></a><span class="lineno"> 3754</span>&#160;      <span class="keywordflow">if</span>( depth&lt;=0 || depth&gt;tree.maxDepth() ) depth = tree.maxDepth();</div>
<div class="line"><a name="l03755"></a><span class="lineno"> 3755</span>&#160;      BSplineData&lt; Degree , Real &gt; fData;</div>
<div class="line"><a name="l03756"></a><span class="lineno"> 3756</span>&#160;      fData.set( depth );</div>
<div class="line"><a name="l03757"></a><span class="lineno"> 3757</span>&#160;      fData.setValueTables( fData.VALUE_FLAG );</div>
<div class="line"><a name="l03758"></a><span class="lineno"> 3758</span>&#160;      res = 1&lt;&lt;depth;</div>
<div class="line"><a name="l03759"></a><span class="lineno"> 3759</span>&#160;      Real* values = <span class="keyword">new</span> <span class="keywordtype">float</span>[ res * res * res ];</div>
<div class="line"><a name="l03760"></a><span class="lineno"> 3760</span>&#160;      memset( values , 0 , <span class="keyword">sizeof</span>( <span class="keywordtype">float</span> ) * res  * res * res );</div>
<div class="line"><a name="l03761"></a><span class="lineno"> 3761</span>&#160; </div>
<div class="line"><a name="l03762"></a><span class="lineno"> 3762</span>&#160;      <span class="keywordflow">for</span>( TreeOctNode* n=tree.nextNode() ; n ; n=tree.nextNode( n ) )</div>
<div class="line"><a name="l03763"></a><span class="lineno"> 3763</span>&#160;      {</div>
<div class="line"><a name="l03764"></a><span class="lineno"> 3764</span>&#160;        <span class="keywordflow">if</span>( n-&gt;d&gt;depth ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l03765"></a><span class="lineno"> 3765</span>&#160;        <span class="keywordflow">if</span>( n-&gt;d&lt;_minDepth ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l03766"></a><span class="lineno"> 3766</span>&#160;        <span class="keywordtype">int</span> d , idx[3] , start[3] , end[3];</div>
<div class="line"><a name="l03767"></a><span class="lineno"> 3767</span>&#160;        n-&gt;depthAndOffset( d , idx );</div>
<div class="line"><a name="l03768"></a><span class="lineno"> 3768</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;3 ; i++ )</div>
<div class="line"><a name="l03769"></a><span class="lineno"> 3769</span>&#160;        {</div>
<div class="line"><a name="l03770"></a><span class="lineno"> 3770</span>&#160;          <span class="comment">// Get the index of the functions</span></div>
<div class="line"><a name="l03771"></a><span class="lineno"> 3771</span>&#160;          idx[i] = BinaryNode&lt; double &gt;::CenterIndex( d , idx[i] );</div>
<div class="line"><a name="l03772"></a><span class="lineno"> 3772</span>&#160;          <span class="comment">// Figure out which samples fall into the range</span></div>
<div class="line"><a name="l03773"></a><span class="lineno"> 3773</span>&#160;          fData.setSampleSpan( idx[i] , start[i] , end[i] );</div>
<div class="line"><a name="l03774"></a><span class="lineno"> 3774</span>&#160;          <span class="comment">// We only care about the odd indices</span></div>
<div class="line"><a name="l03775"></a><span class="lineno"> 3775</span>&#160;          <span class="keywordflow">if</span>( !(start[i]&amp;1) ) start[i]++;</div>
<div class="line"><a name="l03776"></a><span class="lineno"> 3776</span>&#160;          <span class="keywordflow">if</span>( !(  end[i]&amp;1) )   end[i]--;</div>
<div class="line"><a name="l03777"></a><span class="lineno"> 3777</span>&#160;        }</div>
<div class="line"><a name="l03778"></a><span class="lineno"> 3778</span>&#160;        Real coefficient = n-&gt;nodeData.solution;</div>
<div class="line"><a name="l03779"></a><span class="lineno"> 3779</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=start[0] ; x&lt;=end[0] ; x+=2 )</div>
<div class="line"><a name="l03780"></a><span class="lineno"> 3780</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=start[1] ; y&lt;=end[1] ; y+=2 )</div>
<div class="line"><a name="l03781"></a><span class="lineno"> 3781</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=start[2] ; z&lt;=end[2] ; z+=2 )</div>
<div class="line"><a name="l03782"></a><span class="lineno"> 3782</span>&#160;            {</div>
<div class="line"><a name="l03783"></a><span class="lineno"> 3783</span>&#160;              <span class="keywordtype">int</span> xx = (x-1)&gt;&gt;1 , yy = (y-1)&gt;&gt;1 , zz = (z-1)&gt;&gt;1;</div>
<div class="line"><a name="l03784"></a><span class="lineno"> 3784</span>&#160;              values[ zz*res*res + yy*res + xx ] +=</div>
<div class="line"><a name="l03785"></a><span class="lineno"> 3785</span>&#160;                  coefficient *</div>
<div class="line"><a name="l03786"></a><span class="lineno"> 3786</span>&#160;                  fData.valueTables[ idx[0]+x*fData.functionCount ] *</div>
<div class="line"><a name="l03787"></a><span class="lineno"> 3787</span>&#160;                  fData.valueTables[ idx[1]+y*fData.functionCount ] *</div>
<div class="line"><a name="l03788"></a><span class="lineno"> 3788</span>&#160;                  fData.valueTables[ idx[2]+z*fData.functionCount ];</div>
<div class="line"><a name="l03789"></a><span class="lineno"> 3789</span>&#160;            }</div>
<div class="line"><a name="l03790"></a><span class="lineno"> 3790</span>&#160;      }</div>
<div class="line"><a name="l03791"></a><span class="lineno"> 3791</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;res*res*res ; i++ ) values[i] -= isoValue;</div>
<div class="line"><a name="l03792"></a><span class="lineno"> 3792</span>&#160; </div>
<div class="line"><a name="l03793"></a><span class="lineno"> 3793</span>&#160;      <span class="keywordflow">return</span> values;</div>
<div class="line"><a name="l03794"></a><span class="lineno"> 3794</span>&#160;    }</div>
<div class="line"><a name="l03795"></a><span class="lineno"> 3795</span>&#160;    <span class="keyword">template</span>&lt; <span class="keywordtype">int</span> Degree &gt;</div>
<div class="line"><a name="l03796"></a><span class="lineno"> 3796</span>&#160;    Real* Octree&lt; Degree &gt;::GetWeightGrid( <span class="keywordtype">int</span>&amp; res , <span class="keywordtype">int</span> depth )</div>
<div class="line"><a name="l03797"></a><span class="lineno"> 3797</span>&#160;    {</div>
<div class="line"><a name="l03798"></a><span class="lineno"> 3798</span>&#160;      <span class="keywordflow">if</span>( depth&lt;=0 || depth&gt;tree.maxDepth() ) depth = tree.maxDepth();</div>
<div class="line"><a name="l03799"></a><span class="lineno"> 3799</span>&#160;      res = 1&lt;&lt;tree.maxDepth();</div>
<div class="line"><a name="l03800"></a><span class="lineno"> 3800</span>&#160;      Real* values = <span class="keyword">new</span> <span class="keywordtype">float</span>[ res * res * res ];</div>
<div class="line"><a name="l03801"></a><span class="lineno"> 3801</span>&#160;      memset( values , 0 , <span class="keyword">sizeof</span>( <span class="keywordtype">float</span> ) * res  * res * res );</div>
<div class="line"><a name="l03802"></a><span class="lineno"> 3802</span>&#160; </div>
<div class="line"><a name="l03803"></a><span class="lineno"> 3803</span>&#160;      <span class="keywordflow">for</span>( TreeOctNode* n=tree.nextNode() ; n ; n=tree.nextNode( n ) )</div>
<div class="line"><a name="l03804"></a><span class="lineno"> 3804</span>&#160;      {</div>
<div class="line"><a name="l03805"></a><span class="lineno"> 3805</span>&#160;        <span class="keywordflow">if</span>( n-&gt;d&gt;depth ) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l03806"></a><span class="lineno"> 3806</span>&#160;        <span class="keywordtype">int</span> d , idx[3] , start[3] , end[3];</div>
<div class="line"><a name="l03807"></a><span class="lineno"> 3807</span>&#160;        n-&gt;depthAndOffset( d , idx );</div>
<div class="line"><a name="l03808"></a><span class="lineno"> 3808</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;3 ; i++ )</div>
<div class="line"><a name="l03809"></a><span class="lineno"> 3809</span>&#160;        {</div>
<div class="line"><a name="l03810"></a><span class="lineno"> 3810</span>&#160;          <span class="comment">// Get the index of the functions</span></div>
<div class="line"><a name="l03811"></a><span class="lineno"> 3811</span>&#160;          idx[i] = BinaryNode&lt; double &gt;::CenterIndex( d , idx[i] );</div>
<div class="line"><a name="l03812"></a><span class="lineno"> 3812</span>&#160;          <span class="comment">// Figure out which samples fall into the range</span></div>
<div class="line"><a name="l03813"></a><span class="lineno"> 3813</span>&#160;          fData.setSampleSpan( idx[i] , start[i] , end[i] );</div>
<div class="line"><a name="l03814"></a><span class="lineno"> 3814</span>&#160;          <span class="comment">// We only care about the odd indices</span></div>
<div class="line"><a name="l03815"></a><span class="lineno"> 3815</span>&#160;          <span class="keywordflow">if</span>( !(start[i]&amp;1) ) start[i]++;</div>
<div class="line"><a name="l03816"></a><span class="lineno"> 3816</span>&#160;          <span class="keywordflow">if</span>( !(  end[i]&amp;1) )   end[i]--;</div>
<div class="line"><a name="l03817"></a><span class="lineno"> 3817</span>&#160;        }</div>
<div class="line"><a name="l03818"></a><span class="lineno"> 3818</span>&#160;        <span class="keywordflow">for</span>( <span class="keywordtype">int</span> x=start[0] ; x&lt;=end[0] ; x+=2 )</div>
<div class="line"><a name="l03819"></a><span class="lineno"> 3819</span>&#160;          <span class="keywordflow">for</span>( <span class="keywordtype">int</span> y=start[1] ; y&lt;=end[1] ; y+=2 )</div>
<div class="line"><a name="l03820"></a><span class="lineno"> 3820</span>&#160;            <span class="keywordflow">for</span>( <span class="keywordtype">int</span> z=start[2] ; z&lt;=end[2] ; z+=2 )</div>
<div class="line"><a name="l03821"></a><span class="lineno"> 3821</span>&#160;            {</div>
<div class="line"><a name="l03822"></a><span class="lineno"> 3822</span>&#160;              <span class="keywordtype">int</span> xx = (x-1)&gt;&gt;1 , yy = (y-1)&gt;&gt;1 , zz = (z-1)&gt;&gt;1;</div>
<div class="line"><a name="l03823"></a><span class="lineno"> 3823</span>&#160;              values[ zz*res*res + yy*res + xx ] +=</div>
<div class="line"><a name="l03824"></a><span class="lineno"> 3824</span>&#160;                  n-&gt;nodeData.centerWeightContribution *</div>
<div class="line"><a name="l03825"></a><span class="lineno"> 3825</span>&#160;                  fData.valueTables[ idx[0]+x*fData.functionCount ] *</div>
<div class="line"><a name="l03826"></a><span class="lineno"> 3826</span>&#160;                  fData.valueTables[ idx[1]+y*fData.functionCount ] *</div>
<div class="line"><a name="l03827"></a><span class="lineno"> 3827</span>&#160;                  fData.valueTables[ idx[2]+z*fData.functionCount ];</div>
<div class="line"><a name="l03828"></a><span class="lineno"> 3828</span>&#160;            }</div>
<div class="line"><a name="l03829"></a><span class="lineno"> 3829</span>&#160;      }</div>
<div class="line"><a name="l03830"></a><span class="lineno"> 3830</span>&#160;      <span class="keywordflow">return</span> values;</div>
<div class="line"><a name="l03831"></a><span class="lineno"> 3831</span>&#160;    }</div>
<div class="line"><a name="l03832"></a><span class="lineno"> 3832</span>&#160; </div>
<div class="line"><a name="l03834"></a><span class="lineno"> 3834</span>&#160;    <span class="comment">// VertexData //</span></div>
<div class="line"><a name="l03836"></a><span class="lineno"> 3836</span>&#160;<span class="comment"></span>    <span class="keywordtype">long</span> <span class="keywordtype">long</span> VertexData::CenterIndex(<span class="keyword">const</span> TreeOctNode* node,<span class="keywordtype">int</span> maxDepth){</div>
<div class="line"><a name="l03837"></a><span class="lineno"> 3837</span>&#160;      <span class="keywordtype">int</span> idx[DIMENSION];</div>
<div class="line"><a name="l03838"></a><span class="lineno"> 3838</span>&#160;      <span class="keywordflow">return</span> CenterIndex(node,maxDepth,idx);</div>
<div class="line"><a name="l03839"></a><span class="lineno"> 3839</span>&#160;    }</div>
<div class="line"><a name="l03840"></a><span class="lineno"> 3840</span>&#160;    <span class="keywordtype">long</span> <span class="keywordtype">long</span> VertexData::CenterIndex(<span class="keyword">const</span> TreeOctNode* node,<span class="keywordtype">int</span> maxDepth,<span class="keywordtype">int</span> idx[DIMENSION]){</div>
<div class="line"><a name="l03841"></a><span class="lineno"> 3841</span>&#160;      <span class="keywordtype">int</span> d,o[3];</div>
<div class="line"><a name="l03842"></a><span class="lineno"> 3842</span>&#160;      node-&gt;depthAndOffset(d,o);</div>
<div class="line"><a name="l03843"></a><span class="lineno"> 3843</span>&#160;      <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;DIMENSION;i++){idx[i]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d+1,o[i]&lt;&lt;1,1);}</div>
<div class="line"><a name="l03844"></a><span class="lineno"> 3844</span>&#160;      <span class="keywordflow">return</span> (<span class="keywordtype">long</span> <span class="keywordtype">long</span>)(idx[0]) | (<span class="keywordtype">long</span> <span class="keywordtype">long</span>)(idx[1])&lt;&lt;15 | (<span class="keywordtype">long</span> <span class="keywordtype">long</span>)(idx[2])&lt;&lt;30;</div>
<div class="line"><a name="l03845"></a><span class="lineno"> 3845</span>&#160;    }</div>
<div class="line"><a name="l03846"></a><span class="lineno"> 3846</span>&#160;    <span class="keywordtype">long</span> <span class="keywordtype">long</span> VertexData::CenterIndex(<span class="keywordtype">int</span> depth,<span class="keyword">const</span> <span class="keywordtype">int</span> offSet[DIMENSION],<span class="keywordtype">int</span> maxDepth,<span class="keywordtype">int</span> idx[DIMENSION]){</div>
<div class="line"><a name="l03847"></a><span class="lineno"> 3847</span>&#160;      <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;DIMENSION;i++){idx[i]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,depth+1,offSet[i]&lt;&lt;1,1);}</div>
<div class="line"><a name="l03848"></a><span class="lineno"> 3848</span>&#160;      <span class="keywordflow">return</span> (<span class="keywordtype">long</span> <span class="keywordtype">long</span>)(idx[0]) | (<span class="keywordtype">long</span> <span class="keywordtype">long</span>)(idx[1])&lt;&lt;15 | (<span class="keywordtype">long</span> <span class="keywordtype">long</span>)(idx[2])&lt;&lt;30;</div>
<div class="line"><a name="l03849"></a><span class="lineno"> 3849</span>&#160;    }</div>
<div class="line"><a name="l03850"></a><span class="lineno"> 3850</span>&#160;    <span class="keywordtype">long</span> <span class="keywordtype">long</span> VertexData::CornerIndex(<span class="keyword">const</span> TreeOctNode* node,<span class="keywordtype">int</span> cIndex,<span class="keywordtype">int</span> maxDepth){</div>
<div class="line"><a name="l03851"></a><span class="lineno"> 3851</span>&#160;      <span class="keywordtype">int</span> idx[DIMENSION];</div>
<div class="line"><a name="l03852"></a><span class="lineno"> 3852</span>&#160;      <span class="keywordflow">return</span> CornerIndex(node,cIndex,maxDepth,idx);</div>
<div class="line"><a name="l03853"></a><span class="lineno"> 3853</span>&#160;    }</div>
<div class="line"><a name="l03854"></a><span class="lineno"> 3854</span>&#160;    <span class="keywordtype">long</span> <span class="keywordtype">long</span> VertexData::CornerIndex( <span class="keyword">const</span> TreeOctNode* node , <span class="keywordtype">int</span> cIndex , <span class="keywordtype">int</span> maxDepth , <span class="keywordtype">int</span> idx[DIMENSION] )</div>
<div class="line"><a name="l03855"></a><span class="lineno"> 3855</span>&#160;    {</div>
<div class="line"><a name="l03856"></a><span class="lineno"> 3856</span>&#160;      <span class="keywordtype">int</span> x[DIMENSION];</div>
<div class="line"><a name="l03857"></a><span class="lineno"> 3857</span>&#160;      Cube::FactorCornerIndex( cIndex , x[0] , x[1] , x[2] );</div>
<div class="line"><a name="l03858"></a><span class="lineno"> 3858</span>&#160;      <span class="keywordtype">int</span> d , o[3];</div>
<div class="line"><a name="l03859"></a><span class="lineno"> 3859</span>&#160;      node-&gt;depthAndOffset( d , o );</div>
<div class="line"><a name="l03860"></a><span class="lineno"> 3860</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;DIMENSION ; i++ ) idx[i] = BinaryNode&lt;Real&gt;::CornerIndex( maxDepth+1 , d , o[i] , x[i] );</div>
<div class="line"><a name="l03861"></a><span class="lineno"> 3861</span>&#160;      <span class="keywordflow">return</span> CornerIndexKey( idx );</div>
<div class="line"><a name="l03862"></a><span class="lineno"> 3862</span>&#160;    }</div>
<div class="line"><a name="l03863"></a><span class="lineno"> 3863</span>&#160;    <span class="keywordtype">long</span> <span class="keywordtype">long</span> VertexData::CornerIndex( <span class="keywordtype">int</span> depth , <span class="keyword">const</span> <span class="keywordtype">int</span> offSet[DIMENSION] , <span class="keywordtype">int</span> cIndex , <span class="keywordtype">int</span> maxDepth , <span class="keywordtype">int</span> idx[DIMENSION] )</div>
<div class="line"><a name="l03864"></a><span class="lineno"> 3864</span>&#160;    {</div>
<div class="line"><a name="l03865"></a><span class="lineno"> 3865</span>&#160;      <span class="keywordtype">int</span> x[DIMENSION];</div>
<div class="line"><a name="l03866"></a><span class="lineno"> 3866</span>&#160;      Cube::FactorCornerIndex( cIndex , x[0] , x[1] , x[2] );</div>
<div class="line"><a name="l03867"></a><span class="lineno"> 3867</span>&#160;      <span class="keywordflow">for</span>( <span class="keywordtype">int</span> i=0 ; i&lt;DIMENSION ; i++ ) idx[i] = BinaryNode&lt;Real&gt;::CornerIndex( maxDepth+1 , depth , offSet[i] , x[i] );</div>
<div class="line"><a name="l03868"></a><span class="lineno"> 3868</span>&#160;      <span class="keywordflow">return</span> CornerIndexKey( idx );</div>
<div class="line"><a name="l03869"></a><span class="lineno"> 3869</span>&#160;    }</div>
<div class="line"><a name="l03870"></a><span class="lineno"> 3870</span>&#160;    <span class="keywordtype">long</span> <span class="keywordtype">long</span> VertexData::CornerIndexKey( <span class="keyword">const</span> <span class="keywordtype">int</span> idx[DIMENSION] )</div>
<div class="line"><a name="l03871"></a><span class="lineno"> 3871</span>&#160;    {</div>
<div class="line"><a name="l03872"></a><span class="lineno"> 3872</span>&#160;      <span class="keywordflow">return</span> (<span class="keywordtype">long</span> <span class="keywordtype">long</span>)(idx[0]) | (<span class="keywordtype">long</span> <span class="keywordtype">long</span>)(idx[1])&lt;&lt;15 | (<span class="keywordtype">long</span> <span class="keywordtype">long</span>)(idx[2])&lt;&lt;30;</div>
<div class="line"><a name="l03873"></a><span class="lineno"> 3873</span>&#160;    }</div>
<div class="line"><a name="l03874"></a><span class="lineno"> 3874</span>&#160;    <span class="keywordtype">long</span> <span class="keywordtype">long</span> VertexData::FaceIndex(<span class="keyword">const</span> TreeOctNode* node,<span class="keywordtype">int</span> fIndex,<span class="keywordtype">int</span> maxDepth){</div>
<div class="line"><a name="l03875"></a><span class="lineno"> 3875</span>&#160;      <span class="keywordtype">int</span> idx[DIMENSION];</div>
<div class="line"><a name="l03876"></a><span class="lineno"> 3876</span>&#160;      <span class="keywordflow">return</span> FaceIndex(node,fIndex,maxDepth,idx);</div>
<div class="line"><a name="l03877"></a><span class="lineno"> 3877</span>&#160;    }</div>
<div class="line"><a name="l03878"></a><span class="lineno"> 3878</span>&#160;    <span class="keywordtype">long</span> <span class="keywordtype">long</span> VertexData::FaceIndex(<span class="keyword">const</span> TreeOctNode* node,<span class="keywordtype">int</span> fIndex,<span class="keywordtype">int</span> maxDepth,<span class="keywordtype">int</span> idx[DIMENSION]){</div>
<div class="line"><a name="l03879"></a><span class="lineno"> 3879</span>&#160;      <span class="keywordtype">int</span> dir,offset;</div>
<div class="line"><a name="l03880"></a><span class="lineno"> 3880</span>&#160;      Cube::FactorFaceIndex(fIndex,dir,offset);</div>
<div class="line"><a name="l03881"></a><span class="lineno"> 3881</span>&#160;      <span class="keywordtype">int</span> d,o[3];</div>
<div class="line"><a name="l03882"></a><span class="lineno"> 3882</span>&#160;      node-&gt;depthAndOffset(d,o);</div>
<div class="line"><a name="l03883"></a><span class="lineno"> 3883</span>&#160;      <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;DIMENSION;i++){idx[i]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d+1,o[i]&lt;&lt;1,1);}</div>
<div class="line"><a name="l03884"></a><span class="lineno"> 3884</span>&#160;      idx[dir]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,o[dir],offset);</div>
<div class="line"><a name="l03885"></a><span class="lineno"> 3885</span>&#160;      <span class="keywordflow">return</span> (<span class="keywordtype">long</span> <span class="keywordtype">long</span>)(idx[0]) | (<span class="keywordtype">long</span> <span class="keywordtype">long</span>)(idx[1])&lt;&lt;15 | (<span class="keywordtype">long</span> <span class="keywordtype">long</span>)(idx[2])&lt;&lt;30;</div>
<div class="line"><a name="l03886"></a><span class="lineno"> 3886</span>&#160;    }</div>
<div class="line"><a name="l03887"></a><span class="lineno"> 3887</span>&#160;    <span class="keywordtype">long</span> <span class="keywordtype">long</span> VertexData::EdgeIndex(<span class="keyword">const</span> TreeOctNode* node,<span class="keywordtype">int</span> eIndex,<span class="keywordtype">int</span> maxDepth){</div>
<div class="line"><a name="l03888"></a><span class="lineno"> 3888</span>&#160;      <span class="keywordtype">int</span> idx[DIMENSION];</div>
<div class="line"><a name="l03889"></a><span class="lineno"> 3889</span>&#160;      <span class="keywordflow">return</span> EdgeIndex(node,eIndex,maxDepth,idx);</div>
<div class="line"><a name="l03890"></a><span class="lineno"> 3890</span>&#160;    }</div>
<div class="line"><a name="l03891"></a><span class="lineno"> 3891</span>&#160;    <span class="keywordtype">long</span> <span class="keywordtype">long</span> VertexData::EdgeIndex(<span class="keyword">const</span> TreeOctNode* node,<span class="keywordtype">int</span> eIndex,<span class="keywordtype">int</span> maxDepth,<span class="keywordtype">int</span> idx[DIMENSION]){</div>
<div class="line"><a name="l03892"></a><span class="lineno"> 3892</span>&#160;      <span class="keywordtype">int</span> o,i1,i2;</div>
<div class="line"><a name="l03893"></a><span class="lineno"> 3893</span>&#160;      <span class="keywordtype">int</span> d,off[3];</div>
<div class="line"><a name="l03894"></a><span class="lineno"> 3894</span>&#160;      node-&gt;depthAndOffset(d,off);</div>
<div class="line"><a name="l03895"></a><span class="lineno"> 3895</span>&#160;      <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;DIMENSION;i++){idx[i]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d+1,off[i]&lt;&lt;1,1);}</div>
<div class="line"><a name="l03896"></a><span class="lineno"> 3896</span>&#160;      Cube::FactorEdgeIndex(eIndex,o,i1,i2);</div>
<div class="line"><a name="l03897"></a><span class="lineno"> 3897</span>&#160;      <span class="keywordflow">switch</span>(o){</div>
<div class="line"><a name="l03898"></a><span class="lineno"> 3898</span>&#160;      <span class="keywordflow">case</span> 0:</div>
<div class="line"><a name="l03899"></a><span class="lineno"> 3899</span>&#160;        idx[1]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,off[1],i1);</div>
<div class="line"><a name="l03900"></a><span class="lineno"> 3900</span>&#160;        idx[2]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,off[2],i2);</div>
<div class="line"><a name="l03901"></a><span class="lineno"> 3901</span>&#160;        <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l03902"></a><span class="lineno"> 3902</span>&#160;      <span class="keywordflow">case</span> 1:</div>
<div class="line"><a name="l03903"></a><span class="lineno"> 3903</span>&#160;        idx[0]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,off[0],i1);</div>
<div class="line"><a name="l03904"></a><span class="lineno"> 3904</span>&#160;        idx[2]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,off[2],i2);</div>
<div class="line"><a name="l03905"></a><span class="lineno"> 3905</span>&#160;        <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l03906"></a><span class="lineno"> 3906</span>&#160;      <span class="keywordflow">case</span> 2:</div>
<div class="line"><a name="l03907"></a><span class="lineno"> 3907</span>&#160;        idx[0]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,off[0],i1);</div>
<div class="line"><a name="l03908"></a><span class="lineno"> 3908</span>&#160;        idx[1]=BinaryNode&lt;Real&gt;::CornerIndex(maxDepth+1,d,off[1],i2);</div>
<div class="line"><a name="l03909"></a><span class="lineno"> 3909</span>&#160;        <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l03910"></a><span class="lineno"> 3910</span>&#160;      };</div>
<div class="line"><a name="l03911"></a><span class="lineno"> 3911</span>&#160;      <span class="keywordflow">return</span> (<span class="keywordtype">long</span> <span class="keywordtype">long</span>)(idx[0]) | (<span class="keywordtype">long</span> <span class="keywordtype">long</span>)(idx[1])&lt;&lt;15 | (<span class="keywordtype">long</span> <span class="keywordtype">long</span>)(idx[2])&lt;&lt;30;</div>
<div class="line"><a name="l03912"></a><span class="lineno"> 3912</span>&#160;    }</div>
<div class="line"><a name="l03913"></a><span class="lineno"> 3913</span>&#160; </div>
<div class="line"><a name="l03914"></a><span class="lineno"> 3914</span>&#160;    </div>
<div class="line"><a name="l03915"></a><span class="lineno"> 3915</span>&#160;  }</div>
<div class="line"><a name="l03916"></a><span class="lineno"> 3916</span>&#160;}</div>
<div class="line"><a name="l03917"></a><span class="lineno"> 3917</span>&#160; </div>
<div class="line"><a name="l03918"></a><span class="lineno"> 3918</span>&#160; </div>
<div class="ttc" id="aclasspcl_1_1_point_cloud_html"><div class="ttname"><a href="classpcl_1_1_point_cloud.html">pcl::PointCloud&lt; PointNT &gt;</a></div></div>
<div class="ttc" id="aclasspcl_1_1poisson_1_1_octree_html"><div class="ttname"><a href="classpcl_1_1poisson_1_1_octree.html">pcl::poisson::Octree</a></div><div class="ttdef"><b>Definition:</b> multi_grid_octree_data.h:196</div></div>
<div class="ttc" id="aclasspcl_1_1poisson_1_1_sorted_tree_nodes_html"><div class="ttname"><a href="classpcl_1_1poisson_1_1_sorted_tree_nodes.html">pcl::poisson::SortedTreeNodes</a></div><div class="ttdef"><b>Definition:</b> multi_grid_octree_data.h:115</div></div>
<div class="ttc" id="aclasspcl_1_1poisson_1_1_vector_html"><div class="ttname"><a href="classpcl_1_1poisson_1_1_vector.html">pcl::poisson::Vector</a></div><div class="ttdef"><b>Definition:</b> vector.h:42</div></div>
<div class="ttc" id="astructpcl_1_1_point_x_y_z_r_g_b_a_html"><div class="ttname"><a href="structpcl_1_1_point_x_y_z_r_g_b_a.html">pcl::PointXYZRGBA</a></div><div class="ttdoc">A point structure representing Euclidean xyz coordinates, and the RGBA color.</div><div class="ttdef"><b>Definition:</b> point_types.hpp:540</div></div>
<div class="ttc" id="astructpcl_1_1poisson_1_1_point3_d_html"><div class="ttname"><a href="structpcl_1_1poisson_1_1_point3_d.html">pcl::poisson::Point3D&lt; float &gt;</a></div></div>
<div class="ttc" id="astructpcl_1_1poisson_1_1_up_sample_data_html"><div class="ttname"><a href="structpcl_1_1poisson_1_1_up_sample_data.html">pcl::poisson::UpSampleData</a></div><div class="ttdef"><b>Definition:</b> multi_grid_octree_data.hpp:1473</div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_3eca864c65823895cb378d0a822acbce.html">surface</a></li><li class="navelem"><a class="el" href="dir_3f3c04b1471cb7c6ed159d82d5dbd2e2.html">include</a></li><li class="navelem"><a class="el" href="dir_c085629c2ec3cefd048e595d13476517.html">pcl</a></li><li class="navelem"><a class="el" href="dir_b042217bdec4068b97400d7bbc365877.html">surface</a></li><li class="navelem"><a class="el" href="dir_f289cf8a53139bf575d4708d4be18702.html">3rdparty</a></li><li class="navelem"><a class="el" href="dir_cb244bdbdd28d1e4f2f220ed9667ec05.html">poisson4</a></li><li class="navelem"><b>multi_grid_octree_data.hpp</b></li>
    <li class="footer">制作者 <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1 </li>
  </ul>
</div>
</body>
</html>
